TSTP Solution File: LAT394-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : LAT394-1 : TPTP v8.1.0. Released v5.4.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n012.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 05:48:16 EDT 2022
% Result : Unsatisfiable 1.26s 1.45s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 40 ( 34 unt; 6 typ; 0 def)
% Number of atoms : 88 ( 53 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 278 ( 6 ~; 0 |; 0 &; 272 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 52 ( 0 ^ 52 !; 0 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_and,type,
and: $i > $i > $i ).
thf(tp_f,type,
f: $i > $i > $i ).
thf(tp_neg,type,
neg: $i > $i ).
thf(tp_or,type,
or: $i > $i > $i ).
thf(tp_x0,type,
x0: $i ).
thf(tp_x1,type,
x1: $i ).
thf(1,axiom,
! [A: $i] :
( ( neg @ A )
= ( f @ A @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_003) ).
thf(2,axiom,
! [A: $i,B: $i] :
( ( and @ A @ B )
= ( f @ ( f @ A @ B ) @ ( f @ A @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_002) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( or @ A @ B )
= ( f @ ( f @ A @ A ) @ ( f @ B @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_001) ).
thf(4,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ( f @ ( f @ ( f @ ( f @ A @ B ) @ ( f @ B @ C ) ) @ D ) @ ( f @ B @ ( f @ ( f @ B @ ( f @ ( f @ A @ A ) @ A ) ) @ C ) ) )
= B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
thf(5,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(6,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[5]) ).
thf(7,negated_conjecture,
( f @ x0 @ ( f @ x0 @ x0 ) )
!= ( f @ x1 @ ( f @ x1 @ x1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
thf(8,plain,
$false = $false,
inference(unfold_def,[status(thm)],[6]) ).
thf(9,plain,
( ( ! [A: $i] :
( ( neg @ A )
= ( f @ A @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(10,plain,
( ( ! [A: $i,B: $i] :
( ( and @ A @ B )
= ( f @ ( f @ A @ B ) @ ( f @ A @ B ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(11,plain,
( ( ! [A: $i,B: $i] :
( ( or @ A @ B )
= ( f @ ( f @ A @ A ) @ ( f @ B @ B ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(12,plain,
( ( ! [A: $i,B: $i,C: $i,D: $i] :
( ( f @ ( f @ ( f @ ( f @ A @ B ) @ ( f @ B @ C ) ) @ D ) @ ( f @ B @ ( f @ ( f @ B @ ( f @ ( f @ A @ A ) @ A ) ) @ C ) ) )
= B ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(13,plain,
( ( ( ( f @ x0 @ ( f @ x0 @ x0 ) )
!= ( f @ x1 @ ( f @ x1 @ x1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(14,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[8]) ).
thf(15,plain,
( ( ( ( f @ x0 @ ( f @ x0 @ x0 ) )
!= ( f @ x1 @ ( f @ x1 @ x1 ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[13]) ).
thf(16,plain,
( ( ( ( f @ x0 @ ( f @ x0 @ x0 ) )
!= ( f @ x1 @ ( f @ x1 @ x1 ) ) ) )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(17,plain,
( ( ! [A: $i,B: $i,C: $i,D: $i] :
( ( f @ ( f @ ( f @ ( f @ A @ B ) @ ( f @ B @ C ) ) @ D ) @ ( f @ B @ ( f @ ( f @ B @ ( f @ ( f @ A @ A ) @ A ) ) @ C ) ) )
= B ) )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(18,plain,
( ( ! [A: $i,B: $i] :
( ( or @ A @ B )
= ( f @ ( f @ A @ A ) @ ( f @ B @ B ) ) ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(19,plain,
( ( ! [A: $i,B: $i] :
( ( and @ A @ B )
= ( f @ ( f @ A @ B ) @ ( f @ A @ B ) ) ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(20,plain,
( ( ! [A: $i] :
( ( neg @ A )
= ( f @ A @ A ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(21,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(22,plain,
( ( ( f @ x0 @ ( f @ x0 @ x0 ) )
= ( f @ x1 @ ( f @ x1 @ x1 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[16]) ).
thf(23,plain,
! [SV1: $i] :
( ( ! [SY9: $i,SY10: $i,SY11: $i] :
( ( f @ ( f @ ( f @ ( f @ SV1 @ SY9 ) @ ( f @ SY9 @ SY10 ) ) @ SY11 ) @ ( f @ SY9 @ ( f @ ( f @ SY9 @ ( f @ ( f @ SV1 @ SV1 ) @ SV1 ) ) @ SY10 ) ) )
= SY9 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(24,plain,
! [SV2: $i] :
( ( ! [SY12: $i] :
( ( or @ SV2 @ SY12 )
= ( f @ ( f @ SV2 @ SV2 ) @ ( f @ SY12 @ SY12 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[18]) ).
thf(25,plain,
! [SV3: $i] :
( ( ! [SY13: $i] :
( ( and @ SV3 @ SY13 )
= ( f @ ( f @ SV3 @ SY13 ) @ ( f @ SV3 @ SY13 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(26,plain,
! [SV4: $i] :
( ( ( neg @ SV4 )
= ( f @ SV4 @ SV4 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(27,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[21]) ).
thf(28,plain,
! [SV5: $i,SV1: $i] :
( ( ! [SY14: $i,SY15: $i] :
( ( f @ ( f @ ( f @ ( f @ SV1 @ SV5 ) @ ( f @ SV5 @ SY14 ) ) @ SY15 ) @ ( f @ SV5 @ ( f @ ( f @ SV5 @ ( f @ ( f @ SV1 @ SV1 ) @ SV1 ) ) @ SY14 ) ) )
= SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(29,plain,
! [SV6: $i,SV2: $i] :
( ( ( or @ SV2 @ SV6 )
= ( f @ ( f @ SV2 @ SV2 ) @ ( f @ SV6 @ SV6 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[24]) ).
thf(30,plain,
! [SV7: $i,SV3: $i] :
( ( ( and @ SV3 @ SV7 )
= ( f @ ( f @ SV3 @ SV7 ) @ ( f @ SV3 @ SV7 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[25]) ).
thf(31,plain,
! [SV8: $i,SV5: $i,SV1: $i] :
( ( ! [SY16: $i] :
( ( f @ ( f @ ( f @ ( f @ SV1 @ SV5 ) @ ( f @ SV5 @ SV8 ) ) @ SY16 ) @ ( f @ SV5 @ ( f @ ( f @ SV5 @ ( f @ ( f @ SV1 @ SV1 ) @ SV1 ) ) @ SV8 ) ) )
= SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[28]) ).
thf(32,plain,
! [SV9: $i,SV8: $i,SV5: $i,SV1: $i] :
( ( ( f @ ( f @ ( f @ ( f @ SV1 @ SV5 ) @ ( f @ SV5 @ SV8 ) ) @ SV9 ) @ ( f @ SV5 @ ( f @ ( f @ SV5 @ ( f @ ( f @ SV1 @ SV1 ) @ SV1 ) ) @ SV8 ) ) )
= SV5 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[31]) ).
thf(33,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[22,32,30,29,27,26]) ).
thf(34,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LAT394-1 : TPTP v8.1.0. Released v5.4.0.
% 0.06/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 28 19:49:18 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34
% 0.13/0.34 No.of.Axioms: 5
% 0.13/0.34
% 0.13/0.34 Length.of.Defs: 0
% 0.13/0.34
% 0.13/0.34 Contains.Choice.Funs: false
% 0.13/0.34 (rf:0,axioms:5,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:7,loop_count:0,foatp_calls:0,translation:fof_full).
% 1.26/1.45
% 1.26/1.45 ********************************
% 1.26/1.45 * All subproblems solved! *
% 1.26/1.45 ********************************
% 1.26/1.45 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:5,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:33,loop_count:0,foatp_calls:1,translation:fof_full)
% 1.26/1.45
% 1.26/1.45 %**** Beginning of derivation protocol ****
% 1.26/1.45 % SZS output start CNFRefutation
% See solution above
% 1.26/1.45
% 1.26/1.45 %**** End of derivation protocol ****
% 1.26/1.45 %**** no. of clauses in derivation: 34 ****
% 1.26/1.45 %**** clause counter: 33 ****
% 1.26/1.45
% 1.26/1.45 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:5,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:33,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------