TSTP Solution File: NUM548+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM548+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : Mon Jul 18 08:37:13 EDT 2022
% Result : Theorem 8.62s 2.57s
% Output : CNFRefutation 8.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 12 unt; 0 nHn; 24 RR)
% Number of literals : 58 ( 9 equ; 36 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_106,plain,
( aSubsetOf0(X1,X2)
| X3 != slbdtsldtrb0(X2,X4)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X3)
| ~ aElementOf0(X4,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8f_rjoq9/lgb.p',i_0_106) ).
cnf(i_0_105,plain,
( sbrdtbr0(X1) = X2
| X3 != slbdtsldtrb0(X4,X2)
| ~ aSet0(X4)
| ~ aElementOf0(X1,X3)
| ~ aElementOf0(X2,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8f_rjoq9/lgb.p',i_0_105) ).
cnf(i_0_111,hypothesis,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8f_rjoq9/lgb.p',i_0_111) ).
cnf(i_0_118,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xS,xk)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8f_rjoq9/lgb.p',i_0_118) ).
cnf(i_0_114,hypothesis,
aSet0(xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8f_rjoq9/lgb.p',i_0_114) ).
cnf(i_0_15,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8f_rjoq9/lgb.p',i_0_15) ).
cnf(i_0_67,plain,
( isFinite0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8f_rjoq9/lgb.p',i_0_67) ).
cnf(i_0_119,negated_conjecture,
~ isFinite0(xQ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8f_rjoq9/lgb.p',i_0_119) ).
cnf(c_0_128,plain,
( aSubsetOf0(X1,X2)
| X3 != slbdtsldtrb0(X2,X4)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X3)
| ~ aElementOf0(X4,szNzAzT0) ),
i_0_106 ).
cnf(c_0_129,plain,
( sbrdtbr0(X1) = X2
| X3 != slbdtsldtrb0(X4,X2)
| ~ aSet0(X4)
| ~ aElementOf0(X1,X3)
| ~ aElementOf0(X2,szNzAzT0) ),
i_0_105 ).
cnf(c_0_130,plain,
( aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| ~ aElementOf0(X1,slbdtsldtrb0(X2,X3))
| ~ aElementOf0(X3,szNzAzT0) ),
inference(er,[status(thm)],[c_0_128]) ).
cnf(c_0_131,hypothesis,
aElementOf0(xk,szNzAzT0),
i_0_111 ).
cnf(c_0_132,plain,
( sbrdtbr0(X1) = X2
| ~ aSet0(X3)
| ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
| ~ aElementOf0(X2,szNzAzT0) ),
inference(er,[status(thm)],[c_0_129]) ).
cnf(c_0_133,hypothesis,
( aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| ~ aElementOf0(X1,slbdtsldtrb0(X2,xk)) ),
inference(spm,[status(thm)],[c_0_130,c_0_131]) ).
cnf(c_0_134,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xS,xk)),
i_0_118 ).
cnf(c_0_135,hypothesis,
aSet0(xS),
i_0_114 ).
cnf(c_0_136,hypothesis,
( sbrdtbr0(X1) = xk
| ~ aSet0(X2)
| ~ aElementOf0(X1,slbdtsldtrb0(X2,xk)) ),
inference(spm,[status(thm)],[c_0_132,c_0_131]) ).
cnf(c_0_137,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
i_0_15 ).
cnf(c_0_138,hypothesis,
aSubsetOf0(xQ,xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_134]),c_0_135])]) ).
cnf(c_0_139,plain,
( isFinite0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
i_0_67 ).
cnf(c_0_140,hypothesis,
sbrdtbr0(xQ) = xk,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_134]),c_0_135])]) ).
cnf(c_0_141,plain,
aSet0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_135])]) ).
cnf(c_0_142,negated_conjecture,
~ isFinite0(xQ),
i_0_119 ).
cnf(c_0_143,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_141]),c_0_131])]),c_0_142]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM548+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n004.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 : Tue Jul 5 23:00:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.62/2.57 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.62/2.57 # No SInE strategy applied
% 8.62/2.57 # Trying AutoSched0 for 150 seconds
% 8.62/2.57 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.62/2.57 # and selection function SelectNewComplexAHP.
% 8.62/2.57 #
% 8.62/2.57 # Preprocessing time : 0.023 s
% 8.62/2.57 # Presaturation interreduction done
% 8.62/2.57
% 8.62/2.57 # Proof found!
% 8.62/2.57 # SZS status Theorem
% 8.62/2.57 # SZS output start CNFRefutation
% See solution above
% 8.62/2.57 # Training examples: 0 positive, 0 negative
% 8.62/2.57
% 8.62/2.57 # -------------------------------------------------
% 8.62/2.57 # User time : 0.035 s
% 8.62/2.57 # System time : 0.007 s
% 8.62/2.57 # Total time : 0.042 s
% 8.62/2.57 # Maximum resident set size: 7128 pages
% 8.62/2.57
%------------------------------------------------------------------------------