TSTP Solution File: GRP121-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : GRP121-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n004.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 : Sat Jul 16 10:15:58 EDT 2022
% Result : Unsatisfiable 2.50s 2.66s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 22 unt; 3 typ; 0 def)
% Number of atoms : 56 ( 31 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 118 ( 6 ~; 0 |; 0 &; 112 @)
% ( 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 : 6 ( 3 usr; 4 con; 0-2 aty)
% Number of variables : 18 ( 0 ^ 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $i ).
thf(tp_identity,type,
identity: $i ).
thf(tp_multiply,type,
multiply: $i > $i > $i ).
thf(1,axiom,
( ( multiply @ identity @ identity )
= identity ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom2) ).
thf(2,axiom,
! [Y: $i,X: $i,Z: $i] :
( ( multiply @ Y @ ( multiply @ ( multiply @ Y @ ( multiply @ ( multiply @ Y @ Y ) @ ( multiply @ X @ Z ) ) ) @ ( multiply @ Z @ ( multiply @ Z @ Z ) ) ) )
= X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
thf(3,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(4,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[3]) ).
thf(5,negated_conjecture,
( multiply @ a @ identity )
!= a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_order3) ).
thf(6,plain,
$false = $false,
inference(unfold_def,[status(thm)],[4]) ).
thf(7,plain,
( ( ( multiply @ identity @ identity )
= identity )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(8,plain,
( ( ! [Y: $i,X: $i,Z: $i] :
( ( multiply @ Y @ ( multiply @ ( multiply @ Y @ ( multiply @ ( multiply @ Y @ Y ) @ ( multiply @ X @ Z ) ) ) @ ( multiply @ Z @ ( multiply @ Z @ Z ) ) ) )
= X ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(9,plain,
( ( ( ( multiply @ a @ identity )
!= a ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(10,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(11,plain,
( ( ( ( multiply @ a @ identity )
!= a ) )
= $true ),
inference(extcnf_combined,[status(esa)],[9]) ).
thf(12,plain,
( ( ( ( multiply @ a @ identity )
!= a ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(13,plain,
( ( ! [Y: $i,X: $i,Z: $i] :
( ( multiply @ Y @ ( multiply @ ( multiply @ Y @ ( multiply @ ( multiply @ Y @ Y ) @ ( multiply @ X @ Z ) ) ) @ ( multiply @ Z @ ( multiply @ Z @ Z ) ) ) )
= X ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(14,plain,
( ( ( multiply @ identity @ identity )
= identity )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(15,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(16,plain,
( ( ( multiply @ a @ identity )
= a )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(17,plain,
! [SV1: $i] :
( ( ! [SY3: $i,SY4: $i] :
( ( multiply @ SV1 @ ( multiply @ ( multiply @ SV1 @ ( multiply @ ( multiply @ SV1 @ SV1 ) @ ( multiply @ SY3 @ SY4 ) ) ) @ ( multiply @ SY4 @ ( multiply @ SY4 @ SY4 ) ) ) )
= SY3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).
thf(18,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(19,plain,
! [SV2: $i,SV1: $i] :
( ( ! [SY5: $i] :
( ( multiply @ SV1 @ ( multiply @ ( multiply @ SV1 @ ( multiply @ ( multiply @ SV1 @ SV1 ) @ ( multiply @ SV2 @ SY5 ) ) ) @ ( multiply @ SY5 @ ( multiply @ SY5 @ SY5 ) ) ) )
= SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(20,plain,
! [SV3: $i,SV2: $i,SV1: $i] :
( ( ( multiply @ SV1 @ ( multiply @ ( multiply @ SV1 @ ( multiply @ ( multiply @ SV1 @ SV1 ) @ ( multiply @ SV2 @ SV3 ) ) ) @ ( multiply @ SV3 @ ( multiply @ SV3 @ SV3 ) ) ) )
= SV2 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(21,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[14,20,18,16]) ).
thf(22,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP121-1 : TPTP v8.1.0. Released v1.2.0.
% 0.03/0.14 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.15/0.36 % Computer : n004.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Tue Jun 14 09:28:54 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.36
% 0.15/0.36 No.of.Axioms: 3
% 0.15/0.36
% 0.15/0.36 Length.of.Defs: 0
% 0.15/0.36
% 0.15/0.36 Contains.Choice.Funs: false
% 0.15/0.37 (rf:0,axioms:3,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:5,loop_count:0,foatp_calls:0,translation:fof_full)
% 2.50/2.66 ********************************
% 2.50/2.66 * All subproblems solved! *
% 2.50/2.66 ********************************
% 2.50/2.66 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:3,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:21,loop_count:0,foatp_calls:1,translation:fof_full)
% 2.50/2.66
% 2.50/2.66 %**** Beginning of derivation protocol ****
% 2.50/2.66 % SZS output start CNFRefutation
% See solution above
% 2.50/2.66
% 2.50/2.66 %**** End of derivation protocol ****
% 2.50/2.66 %**** no. of clauses in derivation: 22 ****
% 2.50/2.66 %**** clause counter: 21 ****
% 2.50/2.66
% 2.50/2.66 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:3,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:21,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------