TSTP Solution File: RNG108+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG108+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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 20:25:01 EDT 2022
% Result : Theorem 7.87s 2.41s
% Output : CNFRefutation 7.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 10 unt; 0 nHn; 23 RR)
% Number of literals : 48 ( 8 equ; 30 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_89,plain,
( aElementOf0(X1,X2)
| X2 != slsdtgt0(X3)
| sdtasdt0(X3,X4) != X1
| ~ aElement0(X3)
| ~ aElement0(X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8yu2_8a0/lgb.p',i_0_89) ).
cnf(i_0_22,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aElement0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8yu2_8a0/lgb.p',i_0_22) ).
cnf(i_0_2,plain,
aElement0(sz00),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8yu2_8a0/lgb.p',i_0_2) ).
cnf(i_0_100,negated_conjecture,
( ~ aElementOf0(sz00,slsdtgt0(xa))
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(xb,slsdtgt0(xb)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8yu2_8a0/lgb.p',i_0_100) ).
cnf(i_0_95,hypothesis,
aElement0(xa),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8yu2_8a0/lgb.p',i_0_95) ).
cnf(i_0_94,hypothesis,
aElement0(xb),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8yu2_8a0/lgb.p',i_0_94) ).
cnf(i_0_16,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aElement0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8yu2_8a0/lgb.p',i_0_16) ).
cnf(i_0_3,plain,
aElement0(sz10),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8yu2_8a0/lgb.p',i_0_3) ).
cnf(c_0_109,plain,
( aElementOf0(X1,X2)
| X2 != slsdtgt0(X3)
| sdtasdt0(X3,X4) != X1
| ~ aElement0(X3)
| ~ aElement0(X4) ),
i_0_89 ).
cnf(c_0_110,plain,
( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(X1))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_109])]) ).
cnf(c_0_111,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aElement0(X1) ),
i_0_22 ).
cnf(c_0_112,plain,
aElement0(sz00),
i_0_2 ).
cnf(c_0_113,negated_conjecture,
( ~ aElementOf0(sz00,slsdtgt0(xa))
| ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(xb,slsdtgt0(xb)) ),
i_0_100 ).
cnf(c_0_114,plain,
( aElementOf0(sz00,slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_112])]) ).
cnf(c_0_115,hypothesis,
aElement0(xa),
i_0_95 ).
cnf(c_0_116,negated_conjecture,
( ~ aElementOf0(sz00,slsdtgt0(xb))
| ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(xb,slsdtgt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_115])]) ).
cnf(c_0_117,hypothesis,
aElement0(xb),
i_0_94 ).
cnf(c_0_118,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aElement0(X1) ),
i_0_16 ).
cnf(c_0_119,plain,
aElement0(sz10),
i_0_3 ).
cnf(c_0_120,plain,
( ~ aElementOf0(xa,slsdtgt0(xa))
| ~ aElementOf0(xb,slsdtgt0(xb)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_114]),c_0_117])]) ).
cnf(c_0_121,plain,
( aElementOf0(X1,slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_118]),c_0_119])]) ).
cnf(c_0_122,plain,
~ aElementOf0(xb,slsdtgt0(xb)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_115])]) ).
cnf(c_0_123,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_121]),c_0_117])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : RNG108+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n018.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 : Mon May 30 19:33:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 7.87/2.41 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.87/2.41 # No SInE strategy applied
% 7.87/2.41 # Trying AutoSched0 for 150 seconds
% 7.87/2.41 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.87/2.41 # and selection function SelectNewComplexAHP.
% 7.87/2.41 #
% 7.87/2.41 # Preprocessing time : 0.013 s
% 7.87/2.41 # Presaturation interreduction done
% 7.87/2.41
% 7.87/2.41 # Proof found!
% 7.87/2.41 # SZS status Theorem
% 7.87/2.41 # SZS output start CNFRefutation
% See solution above
% 7.87/2.41 # Training examples: 0 positive, 0 negative
% 7.87/2.41
% 7.87/2.41 # -------------------------------------------------
% 7.87/2.41 # User time : 0.017 s
% 7.87/2.41 # System time : 0.003 s
% 7.87/2.41 # Total time : 0.019 s
% 7.87/2.41 # Maximum resident set size: 7120 pages
% 7.87/2.41
%------------------------------------------------------------------------------