TSTP Solution File: NUM557+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM557+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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:19 EDT 2022
% Result : Theorem 7.76s 2.33s
% Output : CNFRefutation 7.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 11 unt; 0 nHn; 15 RR)
% Number of literals : 30 ( 6 equ; 17 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_104,plain,
( aElementOf0(X1,X2)
| sbrdtbr0(X1) != X3
| X2 != slbdtsldtrb0(X4,X3)
| ~ aSet0(X4)
| ~ aSubsetOf0(X1,X4)
| ~ aElementOf0(X3,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vry2j19b/lgb.p',i_0_104) ).
cnf(i_0_129,hypothesis,
sbrdtbr0(xP) = xk,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vry2j19b/lgb.p',i_0_129) ).
cnf(i_0_111,hypothesis,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vry2j19b/lgb.p',i_0_111) ).
cnf(i_0_131,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xS,xk)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vry2j19b/lgb.p',i_0_131) ).
cnf(i_0_114,hypothesis,
aSet0(xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vry2j19b/lgb.p',i_0_114) ).
cnf(i_0_130,hypothesis,
aSubsetOf0(xP,xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vry2j19b/lgb.p',i_0_130) ).
cnf(c_0_138,plain,
( aElementOf0(X1,X2)
| sbrdtbr0(X1) != X3
| X2 != slbdtsldtrb0(X4,X3)
| ~ aSet0(X4)
| ~ aSubsetOf0(X1,X4)
| ~ aElementOf0(X3,szNzAzT0) ),
i_0_104 ).
cnf(c_0_139,plain,
( aElementOf0(X1,slbdtsldtrb0(X2,sbrdtbr0(X1)))
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_138])]) ).
cnf(c_0_140,hypothesis,
sbrdtbr0(xP) = xk,
i_0_129 ).
cnf(c_0_141,hypothesis,
aElementOf0(xk,szNzAzT0),
i_0_111 ).
cnf(c_0_142,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xS,xk)),
i_0_131 ).
cnf(c_0_143,hypothesis,
( aElementOf0(xP,slbdtsldtrb0(X1,xk))
| ~ aSet0(X1)
| ~ aSubsetOf0(xP,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_141])]) ).
cnf(c_0_144,hypothesis,
aSet0(xS),
i_0_114 ).
cnf(c_0_145,hypothesis,
aSubsetOf0(xP,xS),
i_0_130 ).
cnf(c_0_146,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_144]),c_0_145])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM557+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n003.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jul 6 16:47:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 7.76/2.33 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.76/2.33 # No SInE strategy applied
% 7.76/2.33 # Trying AutoSched0 for 150 seconds
% 7.76/2.33 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.76/2.33 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.76/2.33 #
% 7.76/2.33 # Preprocessing time : 0.025 s
% 7.76/2.33
% 7.76/2.33 # Proof found!
% 7.76/2.33 # SZS status Theorem
% 7.76/2.33 # SZS output start CNFRefutation
% See solution above
% 7.76/2.33 # Training examples: 0 positive, 0 negative
% 7.76/2.33
% 7.76/2.33 # -------------------------------------------------
% 7.76/2.33 # User time : 0.042 s
% 7.76/2.33 # System time : 0.010 s
% 7.76/2.33 # Total time : 0.052 s
% 7.76/2.33 # Maximum resident set size: 7128 pages
% 7.76/2.33
%------------------------------------------------------------------------------