TSTP Solution File: SYN060-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYN060-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 21 08:23:09 EDT 2022
% Result : Unsatisfiable 0.18s 0.36s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 54 ( 33 unt; 5 typ; 0 def)
% Number of atoms : 186 ( 50 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 142 ( 27 ~; 37 |; 0 &; 78 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 0 ^ 37 !; 0 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_big_f,type,
big_f: $i > $o ).
thf(tp_big_g,type,
big_g: $i > $o ).
thf(tp_big_h,type,
big_h: $i > $o ).
thf(tp_big_i,type,
big_i: $i > $o ).
thf(1,axiom,
! [X: $i] :
( ( big_i @ X )
| ( big_h @ X ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
thf(2,axiom,
! [X: $i] :
( ( big_i @ X )
| ( big_f @ X ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
thf(3,axiom,
! [X: $i] :
( ( big_g @ X )
| ( big_h @ X ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
thf(4,axiom,
! [X: $i] :
( ~ ( big_g @ X )
| ~ ( big_h @ X ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
thf(5,axiom,
! [X: $i] :
( ( big_g @ X )
| ( big_f @ X ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
thf(6,axiom,
! [X: $i] :
( ~ ( big_f @ X )
| ~ ( big_h @ X ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
thf(7,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(8,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[7]) ).
thf(9,negated_conjecture,
~ ( big_i @ a ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
thf(10,plain,
$false = $false,
inference(unfold_def,[status(thm)],[8]) ).
thf(11,plain,
( ( ! [X: $i] :
( ( big_i @ X )
| ( big_h @ X ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(12,plain,
( ( ! [X: $i] :
( ( big_i @ X )
| ( big_f @ X ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(13,plain,
( ( ! [X: $i] :
( ( big_g @ X )
| ( big_h @ X ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(14,plain,
( ( ! [X: $i] :
( ~ ( big_g @ X )
| ~ ( big_h @ X ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(15,plain,
( ( ! [X: $i] :
( ( big_g @ X )
| ( big_f @ X ) ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(16,plain,
( ( ! [X: $i] :
( ~ ( big_f @ X )
| ~ ( big_h @ X ) ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(17,plain,
( ( ~ ( big_i @ a ) )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(18,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[10]) ).
thf(19,plain,
( ( ! [X: $i] :
( ( big_h @ X )
| ( big_i @ X ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[11]) ).
thf(20,plain,
( ( ! [X: $i] :
( ( big_f @ X )
| ( big_i @ X ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[12]) ).
thf(21,plain,
( ( ! [X: $i] :
( ( big_f @ X )
| ( big_g @ X ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[15]) ).
thf(22,plain,
( ( ~ ( big_i @ a ) )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(23,plain,
( ( ! [X: $i] :
( ~ ( big_f @ X )
| ~ ( big_h @ X ) ) )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(24,plain,
( ( ! [X: $i] :
( ( big_f @ X )
| ( big_g @ X ) ) )
= $true ),
inference(copy,[status(thm)],[21]) ).
thf(25,plain,
( ( ! [X: $i] :
( ~ ( big_g @ X )
| ~ ( big_h @ X ) ) )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(26,plain,
( ( ! [X: $i] :
( ( big_g @ X )
| ( big_h @ X ) ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(27,plain,
( ( ! [X: $i] :
( ( big_f @ X )
| ( big_i @ X ) ) )
= $true ),
inference(copy,[status(thm)],[20]) ).
thf(28,plain,
( ( ! [X: $i] :
( ( big_h @ X )
| ( big_i @ X ) ) )
= $true ),
inference(copy,[status(thm)],[19]) ).
thf(29,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(30,plain,
( ( big_i @ a )
= $false ),
inference(extcnf_not_pos,[status(thm)],[22]) ).
thf(31,plain,
! [SV1: $i] :
( ( ~ ( big_f @ SV1 )
| ~ ( big_h @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(32,plain,
! [SV2: $i] :
( ( ( big_f @ SV2 )
| ( big_g @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[24]) ).
thf(33,plain,
! [SV3: $i] :
( ( ~ ( big_g @ SV3 )
| ~ ( big_h @ SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[25]) ).
thf(34,plain,
! [SV4: $i] :
( ( ( big_g @ SV4 )
| ( big_h @ SV4 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[26]) ).
thf(35,plain,
! [SV5: $i] :
( ( ( big_f @ SV5 )
| ( big_i @ SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[27]) ).
thf(36,plain,
! [SV6: $i] :
( ( ( big_h @ SV6 )
| ( big_i @ SV6 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[28]) ).
thf(37,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[29]) ).
thf(38,plain,
! [SV1: $i] :
( ( ( ~ ( big_f @ SV1 ) )
= $true )
| ( ( ~ ( big_h @ SV1 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[31]) ).
thf(39,plain,
! [SV2: $i] :
( ( ( big_f @ SV2 )
= $true )
| ( ( big_g @ SV2 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[32]) ).
thf(40,plain,
! [SV3: $i] :
( ( ( ~ ( big_g @ SV3 ) )
= $true )
| ( ( ~ ( big_h @ SV3 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[33]) ).
thf(41,plain,
! [SV4: $i] :
( ( ( big_g @ SV4 )
= $true )
| ( ( big_h @ SV4 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[34]) ).
thf(42,plain,
! [SV5: $i] :
( ( ( big_f @ SV5 )
= $true )
| ( ( big_i @ SV5 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[35]) ).
thf(43,plain,
! [SV6: $i] :
( ( ( big_h @ SV6 )
= $true )
| ( ( big_i @ SV6 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[36]) ).
thf(44,plain,
! [SV1: $i] :
( ( ( big_f @ SV1 )
= $false )
| ( ( ~ ( big_h @ SV1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[38]) ).
thf(45,plain,
! [SV3: $i] :
( ( ( big_g @ SV3 )
= $false )
| ( ( ~ ( big_h @ SV3 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[40]) ).
thf(46,plain,
! [SV1: $i] :
( ( ( big_h @ SV1 )
= $false )
| ( ( big_f @ SV1 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[44]) ).
thf(47,plain,
! [SV3: $i] :
( ( ( big_h @ SV3 )
= $false )
| ( ( big_g @ SV3 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[45]) ).
thf(48,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[30,47,46,43,42,41,39,37]) ).
thf(49,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN060-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.32 % Computer : n010.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Mon Jul 11 21:19:30 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.33
% 0.13/0.33 No.of.Axioms: 7
% 0.13/0.33
% 0.13/0.33 Length.of.Defs: 0
% 0.13/0.33
% 0.13/0.33 Contains.Choice.Funs: false
% 0.13/0.33 (rf:0,axioms:7,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:9,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.18/0.36
% 0.18/0.36 ********************************
% 0.18/0.36 * All subproblems solved! *
% 0.18/0.36 ********************************
% 0.18/0.36 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:7,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:48,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.18/0.36
% 0.18/0.36 %**** Beginning of derivation protocol ****
% 0.18/0.36 % SZS output start CNFRefutation
% See solution above
% 0.18/0.36
% 0.18/0.36 %**** End of derivation protocol ****
% 0.18/0.36 %**** no. of clauses in derivation: 49 ****
% 0.18/0.36 %**** clause counter: 48 ****
% 0.18/0.36
% 0.18/0.36 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:7,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:48,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------