TSTP Solution File: LDA002-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : LDA002-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 : n028.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 : Sun Jul 17 16:44:47 EDT 2022
% Result : Unsatisfiable 0.90s 1.18s
% Output : CNFRefutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 25
% Syntax : Number of formulae : 61 ( 49 unt; 12 typ; 0 def)
% Number of atoms : 119 ( 76 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 152 ( 6 ~; 0 |; 0 &; 146 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 13 con; 0-2 aty)
% Number of variables : 18 ( 0 ^ 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_b,type,
b: $i ).
thf(tp_f,type,
f: $i > $i > $i ).
thf(tp_n1,type,
n1: $i ).
thf(tp_n2,type,
n2: $i ).
thf(tp_n3,type,
n3: $i ).
thf(tp_u,type,
u: $i ).
thf(tp_u1,type,
u1: $i ).
thf(tp_u2,type,
u2: $i ).
thf(tp_u3,type,
u3: $i ).
thf(tp_uu,type,
uu: $i ).
thf(tp_v,type,
v: $i ).
thf(1,axiom,
( v
= ( f @ uu @ uu ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
thf(2,axiom,
( b
= ( f @ u1 @ u3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).
thf(3,axiom,
( a
= ( f @ ( f @ n3 @ n2 ) @ u2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
thf(4,axiom,
( uu
= ( f @ u @ u ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
thf(5,axiom,
( u3
= ( f @ u @ n3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
thf(6,axiom,
( u2
= ( f @ u @ n2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
thf(7,axiom,
( u1
= ( f @ u @ n1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
thf(8,axiom,
( u
= ( f @ n2 @ n2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
thf(9,axiom,
( n3
= ( f @ n2 @ n1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
thf(10,axiom,
( n2
= ( f @ n1 @ n1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
thf(11,axiom,
! [X: $i,Y: $i,Z: $i] :
( ( f @ X @ ( f @ Y @ Z ) )
= ( f @ ( f @ X @ Y ) @ ( f @ X @ Z ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1) ).
thf(12,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(13,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[12]) ).
thf(14,negated_conjecture,
( f @ a @ v )
!= ( f @ b @ v ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equation) ).
thf(15,plain,
$false = $false,
inference(unfold_def,[status(thm)],[13]) ).
thf(16,plain,
( ( v
= ( f @ uu @ uu ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(17,plain,
( ( b
= ( f @ u1 @ u3 ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(18,plain,
( ( a
= ( f @ ( f @ n3 @ n2 ) @ u2 ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(19,plain,
( ( uu
= ( f @ u @ u ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(20,plain,
( ( u3
= ( f @ u @ n3 ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(21,plain,
( ( u2
= ( f @ u @ n2 ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(22,plain,
( ( u1
= ( f @ u @ n1 ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(23,plain,
( ( u
= ( f @ n2 @ n2 ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(24,plain,
( ( n3
= ( f @ n2 @ n1 ) )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(25,plain,
( ( n2
= ( f @ n1 @ n1 ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(26,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( f @ X @ ( f @ Y @ Z ) )
= ( f @ ( f @ X @ Y ) @ ( f @ X @ Z ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[11]) ).
thf(27,plain,
( ( ( ( f @ a @ v )
!= ( f @ b @ v ) ) )
= $true ),
inference(unfold_def,[status(thm)],[14]) ).
thf(28,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[15]) ).
thf(29,plain,
( ( ( ( f @ a @ v )
!= ( f @ b @ v ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[27]) ).
thf(30,plain,
( ( ( ( f @ a @ v )
!= ( f @ b @ v ) ) )
= $true ),
inference(copy,[status(thm)],[29]) ).
thf(31,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( f @ X @ ( f @ Y @ Z ) )
= ( f @ ( f @ X @ Y ) @ ( f @ X @ Z ) ) ) )
= $true ),
inference(copy,[status(thm)],[26]) ).
thf(32,plain,
( ( n2
= ( f @ n1 @ n1 ) )
= $true ),
inference(copy,[status(thm)],[25]) ).
thf(33,plain,
( ( n3
= ( f @ n2 @ n1 ) )
= $true ),
inference(copy,[status(thm)],[24]) ).
thf(34,plain,
( ( u
= ( f @ n2 @ n2 ) )
= $true ),
inference(copy,[status(thm)],[23]) ).
thf(35,plain,
( ( u1
= ( f @ u @ n1 ) )
= $true ),
inference(copy,[status(thm)],[22]) ).
thf(36,plain,
( ( u2
= ( f @ u @ n2 ) )
= $true ),
inference(copy,[status(thm)],[21]) ).
thf(37,plain,
( ( u3
= ( f @ u @ n3 ) )
= $true ),
inference(copy,[status(thm)],[20]) ).
thf(38,plain,
( ( uu
= ( f @ u @ u ) )
= $true ),
inference(copy,[status(thm)],[19]) ).
thf(39,plain,
( ( a
= ( f @ ( f @ n3 @ n2 ) @ u2 ) )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(40,plain,
( ( b
= ( f @ u1 @ u3 ) )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(41,plain,
( ( v
= ( f @ uu @ uu ) )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(42,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[28]) ).
thf(43,plain,
( ( ( f @ a @ v )
= ( f @ b @ v ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[30]) ).
thf(44,plain,
! [SV1: $i] :
( ( ! [SY3: $i,SY4: $i] :
( ( f @ SV1 @ ( f @ SY3 @ SY4 ) )
= ( f @ ( f @ SV1 @ SY3 ) @ ( f @ SV1 @ SY4 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[31]) ).
thf(45,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[42]) ).
thf(46,plain,
! [SV2: $i,SV1: $i] :
( ( ! [SY5: $i] :
( ( f @ SV1 @ ( f @ SV2 @ SY5 ) )
= ( f @ ( f @ SV1 @ SV2 ) @ ( f @ SV1 @ SY5 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[44]) ).
thf(47,plain,
! [SV3: $i,SV2: $i,SV1: $i] :
( ( ( f @ SV1 @ ( f @ SV2 @ SV3 ) )
= ( f @ ( f @ SV1 @ SV2 ) @ ( f @ SV1 @ SV3 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[46]) ).
thf(48,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[32,47,45,43,41,40,39,38,37,36,35,34,33]) ).
thf(49,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LDA002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon May 30 03:04:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35
% 0.13/0.35 No.of.Axioms: 12
% 0.13/0.35
% 0.13/0.35 Length.of.Defs: 0
% 0.13/0.35
% 0.13/0.35 Contains.Choice.Funs: false
% 0.13/0.35 (rf:0,axioms:12,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:14,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.90/1.18
% 0.90/1.18 ********************************
% 0.90/1.18 * All subproblems solved! *
% 0.90/1.18 ********************************
% 0.90/1.18 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:12,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.90/1.18
% 0.90/1.18 %**** Beginning of derivation protocol ****
% 0.90/1.18 % SZS output start CNFRefutation
% See solution above
% 0.90/1.18
% 0.90/1.18 %**** End of derivation protocol ****
% 0.90/1.18 %**** no. of clauses in derivation: 49 ****
% 0.90/1.18 %**** clause counter: 48 ****
% 0.90/1.18
% 0.90/1.18 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:12,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)
%------------------------------------------------------------------------------