TSTP Solution File: RNG102+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG102+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:24:59 EDT 2022
% Result : Theorem 7.53s 2.44s
% Output : CNFRefutation 7.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 7 unt; 0 nHn; 15 RR)
% Number of literals : 33 ( 10 equ; 20 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_90,plain,
( sdtasdt0(X1,esk18_3(X1,X2,X3)) = X3
| X2 != slsdtgt0(X1)
| ~ aElement0(X1)
| ~ aElementOf0(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xd_9uj0v/input.p',i_0_90) ).
cnf(i_0_91,plain,
( aElement0(esk18_3(X1,X2,X3))
| X2 != slsdtgt0(X1)
| ~ aElement0(X1)
| ~ aElementOf0(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xd_9uj0v/input.p',i_0_91) ).
cnf(i_0_95,hypothesis,
aElementOf0(xy,slsdtgt0(xc)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xd_9uj0v/input.p',i_0_95) ).
cnf(i_0_93,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xd_9uj0v/input.p',i_0_93) ).
cnf(i_0_99,negated_conjecture,
( sdtasdt0(xc,X1) != xy
| ~ aElement0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xd_9uj0v/input.p',i_0_99) ).
cnf(c_0_105,plain,
( sdtasdt0(X1,esk18_3(X1,X2,X3)) = X3
| X2 != slsdtgt0(X1)
| ~ aElement0(X1)
| ~ aElementOf0(X3,X2) ),
i_0_90 ).
cnf(c_0_106,plain,
( aElement0(esk18_3(X1,X2,X3))
| X2 != slsdtgt0(X1)
| ~ aElement0(X1)
| ~ aElementOf0(X3,X2) ),
i_0_91 ).
cnf(c_0_107,plain,
( sdtasdt0(X1,esk18_3(X1,slsdtgt0(X1),X2)) = X2
| ~ aElementOf0(X2,slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_105]) ).
cnf(c_0_108,hypothesis,
aElementOf0(xy,slsdtgt0(xc)),
i_0_95 ).
cnf(c_0_109,hypothesis,
aElement0(xc),
i_0_93 ).
cnf(c_0_110,plain,
( aElement0(esk18_3(X1,slsdtgt0(X1),X2))
| ~ aElementOf0(X2,slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_106]) ).
cnf(c_0_111,negated_conjecture,
( sdtasdt0(xc,X1) != xy
| ~ aElement0(X1) ),
i_0_99 ).
cnf(c_0_112,hypothesis,
sdtasdt0(xc,esk18_3(xc,slsdtgt0(xc),xy)) = xy,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109])]) ).
cnf(c_0_113,hypothesis,
aElement0(esk18_3(xc,slsdtgt0(xc),xy)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_108]),c_0_109])]) ).
cnf(c_0_114,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : RNG102+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 : n023.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 12:40:28 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.45 # ENIGMATIC: Selected complete mode:
% 7.53/2.44 # ENIGMATIC: Solved by autoschedule:
% 7.53/2.44 # No SInE strategy applied
% 7.53/2.44 # Trying AutoSched0 for 150 seconds
% 7.53/2.44 # AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S4d
% 7.53/2.44 # and selection function SelectCQIPrecWNTNp.
% 7.53/2.44 #
% 7.53/2.44 # Preprocessing time : 0.027 s
% 7.53/2.44 # Presaturation interreduction done
% 7.53/2.44
% 7.53/2.44 # Proof found!
% 7.53/2.44 # SZS status Theorem
% 7.53/2.44 # SZS output start CNFRefutation
% See solution above
% 7.53/2.44 # Training examples: 0 positive, 0 negative
% 7.53/2.44
% 7.53/2.44 # -------------------------------------------------
% 7.53/2.44 # User time : 0.033 s
% 7.53/2.44 # System time : 0.012 s
% 7.53/2.44 # Total time : 0.045 s
% 7.53/2.44 # Maximum resident set size: 7120 pages
% 7.53/2.44
%------------------------------------------------------------------------------