TSTP Solution File: SYO885^1.033.003 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO885^1.033.003 : TPTP v8.1.0. Released v7.5.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 : Thu Jul 21 17:38:11 EDT 2022
% Result : Theorem 1.94s 2.19s
% Output : CNFRefutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 8 unt; 4 typ; 0 def)
% Number of atoms : 80 ( 57 equ; 0 cnn)
% Maximal formula atoms : 3 ( 5 avg)
% Number of connectives : 259 ( 19 ~; 16 |; 8 &; 216 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 39 ( 39 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 5 con; 0-3 aty)
% Number of variables : 12 ( 0 ^ 8 !; 4 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a0,type,
a0: $i ).
thf(tp_a1,type,
a1: $i ).
thf(tp_a2,type,
a2: $i ).
thf(tp_f,type,
f: $i > $i > $i > $i ).
thf(1,conjecture,
? [F: $i > $i > $i > $i] :
( ( ( F @ a0 @ a1 @ a2 )
= ( f @ a0 @ a1 @ a2 ) )
& ( ( F @ a0 @ a2 @ a1 )
= ( f @ a0 @ a1 @ a2 ) )
& ( ( F @ a2 @ a1 @ a0 )
= ( f @ a0 @ a1 @ a2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
thf(2,negated_conjecture,
( ( ? [F: $i > $i > $i > $i] :
( ( ( F @ a0 @ a1 @ a2 )
= ( f @ a0 @ a1 @ a2 ) )
& ( ( F @ a0 @ a2 @ a1 )
= ( f @ a0 @ a1 @ a2 ) )
& ( ( F @ a2 @ a1 @ a0 )
= ( f @ a0 @ a1 @ a2 ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ? [F: $i > $i > $i > $i] :
( ( ( F @ a0 @ a1 @ a2 )
= ( f @ a0 @ a1 @ a2 ) )
& ( ( F @ a0 @ a2 @ a1 )
= ( f @ a0 @ a1 @ a2 ) )
& ( ( F @ a2 @ a1 @ a0 )
= ( f @ a0 @ a1 @ a2 ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ~ ? [F: $i > $i > $i > $i] :
( ( ( F @ a0 @ a1 @ a2 )
= ( f @ a0 @ a1 @ a2 ) )
& ( ( F @ a0 @ a2 @ a1 )
= ( f @ a0 @ a1 @ a2 ) )
& ( ( F @ a2 @ a1 @ a0 )
= ( f @ a0 @ a1 @ a2 ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [F: $i > $i > $i > $i] :
( ( ( F @ a0 @ a1 @ a2 )
!= ( f @ a0 @ a1 @ a2 ) )
| ( ( F @ a0 @ a2 @ a1 )
!= ( f @ a0 @ a1 @ a2 ) )
| ( ( F @ a2 @ a1 @ a0 )
!= ( f @ a0 @ a1 @ a2 ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(6,plain,
( ( ! [F: $i > $i > $i > $i] :
( ( ( F @ a0 @ a1 @ a2 )
!= ( f @ a0 @ a1 @ a2 ) )
| ( ( F @ a0 @ a2 @ a1 )
!= ( f @ a0 @ a1 @ a2 ) )
| ( ( F @ a2 @ a1 @ a0 )
!= ( f @ a0 @ a1 @ a2 ) ) ) )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(7,plain,
! [SV1: $i > $i > $i > $i] :
( ( ( ( SV1 @ a0 @ a1 @ a2 )
!= ( f @ a0 @ a1 @ a2 ) )
| ( ( SV1 @ a0 @ a2 @ a1 )
!= ( f @ a0 @ a1 @ a2 ) )
| ( ( SV1 @ a2 @ a1 @ a0 )
!= ( f @ a0 @ a1 @ a2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[6]) ).
thf(8,plain,
! [SV1: $i > $i > $i > $i] :
( ( ( ( ( SV1 @ a0 @ a1 @ a2 )
!= ( f @ a0 @ a1 @ a2 ) )
| ( ( SV1 @ a0 @ a2 @ a1 )
!= ( f @ a0 @ a1 @ a2 ) ) )
= $true )
| ( ( ( ( SV1 @ a2 @ a1 @ a0 )
!= ( f @ a0 @ a1 @ a2 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[7]) ).
thf(9,plain,
! [SV1: $i > $i > $i > $i] :
( ( ( ( ( SV1 @ a0 @ a1 @ a2 )
!= ( f @ a0 @ a1 @ a2 ) ) )
= $true )
| ( ( ( ( SV1 @ a0 @ a2 @ a1 )
!= ( f @ a0 @ a1 @ a2 ) ) )
= $true )
| ( ( ( ( SV1 @ a2 @ a1 @ a0 )
!= ( f @ a0 @ a1 @ a2 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[8]) ).
thf(10,plain,
! [SV1: $i > $i > $i > $i] :
( ( ( ( SV1 @ a0 @ a1 @ a2 )
= ( f @ a0 @ a1 @ a2 ) )
= $false )
| ( ( ( ( SV1 @ a0 @ a2 @ a1 )
!= ( f @ a0 @ a1 @ a2 ) ) )
= $true )
| ( ( ( ( SV1 @ a2 @ a1 @ a0 )
!= ( f @ a0 @ a1 @ a2 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[9]) ).
thf(11,plain,
! [SV1: $i > $i > $i > $i] :
( ( ( ( SV1 @ a0 @ a2 @ a1 )
= ( f @ a0 @ a1 @ a2 ) )
= $false )
| ( ( ( SV1 @ a0 @ a1 @ a2 )
= ( f @ a0 @ a1 @ a2 ) )
= $false )
| ( ( ( ( SV1 @ a2 @ a1 @ a0 )
!= ( f @ a0 @ a1 @ a2 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[10]) ).
thf(12,plain,
! [SV1: $i > $i > $i > $i] :
( ( ( ( SV1 @ a2 @ a1 @ a0 )
= ( f @ a0 @ a1 @ a2 ) )
= $false )
| ( ( ( SV1 @ a0 @ a1 @ a2 )
= ( f @ a0 @ a1 @ a2 ) )
= $false )
| ( ( ( SV1 @ a0 @ a2 @ a1 )
= ( f @ a0 @ a1 @ a2 ) )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(238,plain,
$false = $true,
inference(extuni,[status(esa)],[12:[bind(SV1,$thf( ^ [SX0: $i] : ^ [SX1: $i] : ^ [SX2: $i] : ( f @ a0 @ a1 @ a2 ) ))]]) ).
thf(239,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[238]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYO885^1.033.003 : TPTP v8.1.0. Released v7.5.0.
% 0.13/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 : Sat Jul 9 08:59:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.35
% 0.19/0.35 No.of.Axioms: 0
% 0.19/0.35
% 0.19/0.35 Length.of.Defs: 0
% 0.19/0.35
% 0.19/0.35 Contains.Choice.Funs: false
% 0.19/0.35 (rf:0,axioms:0,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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:2,loop_count:0,foatp_calls:0,translation:fof_full)......
% 1.94/2.19
% 1.94/2.19 ********************************
% 1.94/2.19 * All subproblems solved! *
% 1.94/2.19 ********************************
% 1.94/2.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:0,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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:238,loop_count:0,foatp_calls:1,translation:fof_full)
% 1.94/2.19
% 1.94/2.19 %**** Beginning of derivation protocol ****
% 1.94/2.19 % SZS output start CNFRefutation
% See solution above
% 1.94/2.19
% 1.94/2.19 %**** End of derivation protocol ****
% 1.94/2.19 %**** no. of clauses in derivation: 14 ****
% 1.94/2.19 %**** clause counter: 238 ****
% 1.94/2.19
% 1.94/2.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:0,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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:238,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------