TSTP Solution File: SEV225^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SEV225^5 : TPTP v8.1.0. Bugfixed v5.3.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 : Tue Jul 19 17:35:46 EDT 2022
% Result : Theorem 0.19s 0.36s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 19 unt; 5 typ; 1 def)
% Number of atoms : 68 ( 29 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 64 ( 18 ~; 2 |; 7 &; 34 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 5 con; 0-2 aty)
% Number of variables : 11 ( 0 ^ 11 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_r,type,
r: $tType ).
thf(tp_c0,type,
c0: r ).
thf(tp_cIRREFLEXIVE_LAW,type,
cIRREFLEXIVE_LAW: $o ).
thf(tp_less,type,
less: r > r > $o ).
thf(tp_sK1_Xx,type,
sK1_Xx: r ).
thf(cIRREFLEXIVE_LAW,definition,
( cIRREFLEXIVE_LAW
= ( ! [Xx: r] :
~ ( less @ Xx @ Xx ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cIRREFLEXIVE_LAW) ).
thf(1,conjecture,
( cIRREFLEXIVE_LAW
=> ! [Xx: r] :
~ ( ( less @ Xx @ c0 )
& ( Xx = c0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cPARNAS_FIG3_A) ).
thf(2,negated_conjecture,
( ( cIRREFLEXIVE_LAW
=> ! [Xx: r] :
~ ( ( less @ Xx @ c0 )
& ( Xx = c0 ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [Xx: r] :
~ ( less @ Xx @ Xx )
=> ! [Xx: r] :
~ ( ( less @ Xx @ c0 )
& ( Xx = c0 ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2,cIRREFLEXIVE_LAW]) ).
thf(4,plain,
( ( ! [Xx: r] :
~ ( less @ Xx @ Xx ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [Xx: r] :
~ ( ( less @ Xx @ c0 )
& ( Xx = c0 ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ~ ! [Xx: r] :
~ ( ( less @ Xx @ c0 )
& ( Xx = c0 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(7,plain,
( ( ( sK1_Xx = c0 )
& ( less @ sK1_Xx @ c0 ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(8,plain,
( ( ! [Xx: r] :
~ ( less @ Xx @ Xx ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(9,plain,
( ( ( sK1_Xx = c0 )
& ( less @ sK1_Xx @ c0 ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(10,plain,
( ( ~ ( ( sK1_Xx != c0 )
| ~ ( less @ sK1_Xx @ c0 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[9,cIRREFLEXIVE_LAW]) ).
thf(11,plain,
! [SV1: r] :
( ( ~ ( less @ SV1 @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[8]) ).
thf(12,plain,
( ( ( sK1_Xx != c0 )
| ~ ( less @ sK1_Xx @ c0 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[10]) ).
thf(13,plain,
! [SV1: r] :
( ( less @ SV1 @ SV1 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(14,plain,
( ( ( sK1_Xx != c0 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[12]) ).
thf(15,plain,
( ( ~ ( less @ sK1_Xx @ c0 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[12]) ).
thf(16,plain,
( ( sK1_Xx = c0 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[14]) ).
thf(17,plain,
( ( less @ sK1_Xx @ c0 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[15]) ).
thf(18,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[13,17,16]) ).
thf(19,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEV225^5 : TPTP v8.1.0. Bugfixed v5.3.0.
% 0.03/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.33 % Computer : n028.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 07:54:41 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.33
% 0.13/0.33 No.of.Axioms: 0
% 0.13/0.33
% 0.13/0.33 Length.of.Defs: 161
% 0.13/0.33
% 0.13/0.33 Contains.Choice.Funs: false
% 0.13/0.33 (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)
% 0.19/0.36 ********************************
% 0.19/0.36 * All subproblems solved! *
% 0.19/0.36 ********************************
% 0.19/0.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:1,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:18,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.19/0.36
% 0.19/0.36 %**** Beginning of derivation protocol ****
% 0.19/0.36 % SZS output start CNFRefutation
% See solution above
% 0.19/0.36
% 0.19/0.36 %**** End of derivation protocol ****
% 0.19/0.36 %**** no. of clauses in derivation: 19 ****
% 0.19/0.36 %**** clause counter: 18 ****
% 0.19/0.36
% 0.19/0.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:1,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:18,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------