TSTP Solution File: NUM632+3 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : NUM632+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n005.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 : Mon Jul 18 11:53:24 EDT 2022
% Result : Theorem 0.50s 0.68s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 44
% Syntax : Number of formulae : 57 ( 17 unt; 40 typ; 0 def)
% Number of atoms : 41 ( 24 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 47 ( 2 ~; 0 |; 0 &; 45 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 34 ( 34 >; 0 *; 0 +; 0 <<)
% Number of symbols : 43 ( 40 usr; 19 con; 0-2 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_aElement0,type,
aElement0: $i > $o ).
thf(tp_aElementOf0,type,
aElementOf0: $i > $i > $o ).
thf(tp_aFunction0,type,
aFunction0: $i > $o ).
thf(tp_aSet0,type,
aSet0: $i > $o ).
thf(tp_aSubsetOf0,type,
aSubsetOf0: $i > $i > $o ).
thf(tp_iLess0,type,
iLess0: $i > $i > $o ).
thf(tp_isCountable0,type,
isCountable0: $i > $o ).
thf(tp_isFinite0,type,
isFinite0: $i > $o ).
thf(tp_sbrdtbr0,type,
sbrdtbr0: $i > $i ).
thf(tp_sdtexdt0,type,
sdtexdt0: $i > $i > $i ).
thf(tp_sdtlbdtrb0,type,
sdtlbdtrb0: $i > $i > $i ).
thf(tp_sdtlcdtrc0,type,
sdtlcdtrc0: $i > $i > $i ).
thf(tp_sdtlpdtrp0,type,
sdtlpdtrp0: $i > $i > $i ).
thf(tp_sdtlseqdt0,type,
sdtlseqdt0: $i > $i > $o ).
thf(tp_sdtmndt0,type,
sdtmndt0: $i > $i > $i ).
thf(tp_sdtpldt0,type,
sdtpldt0: $i > $i > $i ).
thf(tp_slbdtrb0,type,
slbdtrb0: $i > $i ).
thf(tp_slbdtsldtrb0,type,
slbdtsldtrb0: $i > $i > $i ).
thf(tp_slcrc0,type,
slcrc0: $i ).
thf(tp_sz00,type,
sz00: $i ).
thf(tp_szDzizrdt0,type,
szDzizrdt0: $i > $i ).
thf(tp_szDzozmdt0,type,
szDzozmdt0: $i > $i ).
thf(tp_szNzAzT0,type,
szNzAzT0: $i ).
thf(tp_szmzazxdt0,type,
szmzazxdt0: $i > $i ).
thf(tp_szmzizndt0,type,
szmzizndt0: $i > $i ).
thf(tp_szszuzczcdt0,type,
szszuzczcdt0: $i > $i ).
thf(tp_xC,type,
xC: $i ).
thf(tp_xK,type,
xK: $i ).
thf(tp_xN,type,
xN: $i ).
thf(tp_xO,type,
xO: $i ).
thf(tp_xP,type,
xP: $i ).
thf(tp_xQ,type,
xQ: $i ).
thf(tp_xS,type,
xS: $i ).
thf(tp_xT,type,
xT: $i ).
thf(tp_xc,type,
xc: $i ).
thf(tp_xd,type,
xd: $i ).
thf(tp_xe,type,
xe: $i ).
thf(tp_xk,type,
xk: $i ).
thf(tp_xn,type,
xn: $i ).
thf(tp_xp,type,
xp: $i ).
thf(62,axiom,
( ( sdtlpdtrp0 @ xc @ xQ )
= ( sdtlpdtrp0 @ xd @ xn ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5568) ).
thf(64,axiom,
( ( sdtlpdtrp0 @ xd @ xn )
= ( szDzizrdt0 @ xd ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5321) ).
thf(71,axiom,
aElementOf0 @ xp @ xQ,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5173) ).
thf(104,conjecture,
( ( sdtlpdtrp0 @ xc @ xQ )
= ( szDzizrdt0 @ xd ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
thf(105,negated_conjecture,
( ( ( sdtlpdtrp0 @ xc @ xQ )
= ( szDzizrdt0 @ xd ) )
= $false ),
inference(negate_conjecture,[status(cth)],[104]) ).
thf(106,plain,
( ( ( sdtlpdtrp0 @ xc @ xQ )
= ( szDzizrdt0 @ xd ) )
= $false ),
inference(unfold_def,[status(thm)],[105]) ).
thf(107,plain,
( ( ( sdtlpdtrp0 @ xc @ xQ )
= ( sdtlpdtrp0 @ xd @ xn ) )
= $true ),
inference(unfold_def,[status(thm)],[62]) ).
thf(108,plain,
( ( ( sdtlpdtrp0 @ xd @ xn )
= ( szDzizrdt0 @ xd ) )
= $true ),
inference(unfold_def,[status(thm)],[64]) ).
thf(109,plain,
( ( aElementOf0 @ xp @ xQ )
= $true ),
inference(unfold_def,[status(thm)],[71]) ).
thf(110,plain,
( ( ( ( sdtlpdtrp0 @ xc @ xQ )
!= ( szDzizrdt0 @ xd ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[106]) ).
thf(111,plain,
( ( aElementOf0 @ xp @ xQ )
= $true ),
inference(copy,[status(thm)],[109]) ).
thf(112,plain,
( ( ( sdtlpdtrp0 @ xd @ xn )
= ( szDzizrdt0 @ xd ) )
= $true ),
inference(copy,[status(thm)],[108]) ).
thf(113,plain,
( ( ( sdtlpdtrp0 @ xc @ xQ )
= ( sdtlpdtrp0 @ xd @ xn ) )
= $true ),
inference(copy,[status(thm)],[107]) ).
thf(114,plain,
( ( ( ( sdtlpdtrp0 @ xc @ xQ )
!= ( szDzizrdt0 @ xd ) ) )
= $true ),
inference(copy,[status(thm)],[110]) ).
thf(115,plain,
( ( ( sdtlpdtrp0 @ xc @ xQ )
= ( szDzizrdt0 @ xd ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[114]) ).
thf(116,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[111,115,113,112]) ).
thf(117,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[116]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM632+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.14/0.34 % Computer : n005.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jul 5 19:22:22 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.43 ...
% 0.39/0.58
% 0.39/0.58 No.of.Axioms: 103
% 0.39/0.58
% 0.39/0.58 Length.of.Defs: 0
% 0.39/0.58
% 0.39/0.58 Contains.Choice.Funs: false
% 0.47/0.63 ......
% 0.47/0.66 (rf:2,axioms:3,ps:3,u:5,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:105,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.50/0.68
% 0.50/0.68 ********************************
% 0.50/0.68 * All subproblems solved! *
% 0.50/0.68 ********************************
% 0.50/0.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:2,axioms:3,ps:3,u:5,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:116,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.50/0.68
% 0.50/0.68 %**** Beginning of derivation protocol ****
% 0.50/0.68 % SZS output start CNFRefutation
% See solution above
% 0.50/0.68
% 0.50/0.68 %**** End of derivation protocol ****
% 0.50/0.68 %**** no. of clauses in derivation: 17 ****
% 0.50/0.68 %**** clause counter: 116 ****
% 0.50/0.68
% 0.50/0.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:2,axioms:3,ps:3,u:5,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:116,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------