TSTP Solution File: RNG104+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG104+2 : 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:25:00 EDT 2022
% Result : Theorem 8.38s 2.57s
% Output : CNFRefutation 8.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of clauses : 24 ( 17 unt; 0 nHn; 24 RR)
% Number of literals : 39 ( 12 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2u6f6uc2/lgb.p',i_0_14) ).
cnf(i_0_101,hypothesis,
sdtasdt0(xc,xu) = xx,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2u6f6uc2/lgb.p',i_0_101) ).
cnf(i_0_102,hypothesis,
aElement0(xu),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2u6f6uc2/lgb.p',i_0_102) ).
cnf(i_0_93,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2u6f6uc2/lgb.p',i_0_93) ).
cnf(i_0_106,negated_conjecture,
sdtasdt0(xc,sdtasdt0(xu,xz)) != sdtasdt0(xz,xx),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2u6f6uc2/lgb.p',i_0_106) ).
cnf(i_0_94,hypothesis,
aElement0(xz),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2u6f6uc2/lgb.p',i_0_94) ).
cnf(i_0_6,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2u6f6uc2/lgb.p',i_0_6) ).
cnf(i_0_99,hypothesis,
sdtasdt0(xc,esk21_0) = xx,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2u6f6uc2/lgb.p',i_0_99) ).
cnf(i_0_100,hypothesis,
aElement0(esk21_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2u6f6uc2/lgb.p',i_0_100) ).
cnf(i_0_13,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2u6f6uc2/lgb.p',i_0_13) ).
cnf(c_0_117,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
i_0_14 ).
cnf(c_0_118,hypothesis,
sdtasdt0(xc,xu) = xx,
i_0_101 ).
cnf(c_0_119,hypothesis,
aElement0(xu),
i_0_102 ).
cnf(c_0_120,hypothesis,
aElement0(xc),
i_0_93 ).
cnf(c_0_121,negated_conjecture,
sdtasdt0(xc,sdtasdt0(xu,xz)) != sdtasdt0(xz,xx),
i_0_106 ).
cnf(c_0_122,hypothesis,
( sdtasdt0(xc,sdtasdt0(xu,X1)) = sdtasdt0(xx,X1)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_119]),c_0_120])]) ).
cnf(c_0_123,hypothesis,
aElement0(xz),
i_0_94 ).
cnf(c_0_124,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
i_0_6 ).
cnf(c_0_125,hypothesis,
sdtasdt0(xc,esk21_0) = xx,
i_0_99 ).
cnf(c_0_126,hypothesis,
aElement0(esk21_0),
i_0_100 ).
cnf(c_0_127,negated_conjecture,
sdtasdt0(xz,xx) != sdtasdt0(xx,xz),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_123])]) ).
cnf(c_0_128,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
i_0_13 ).
cnf(c_0_129,hypothesis,
aElement0(xx),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126]),c_0_120])]) ).
cnf(c_0_130,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_129]),c_0_123])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : RNG104+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.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 : Mon May 30 05:45:58 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.38/2.57 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.38/2.57 # No SInE strategy applied
% 8.38/2.57 # Trying AutoSched0 for 150 seconds
% 8.38/2.57 # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 8.38/2.57 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.38/2.57 #
% 8.38/2.57 # Preprocessing time : 0.024 s
% 8.38/2.57
% 8.38/2.57 # Proof found!
% 8.38/2.57 # SZS status Theorem
% 8.38/2.57 # SZS output start CNFRefutation
% See solution above
% 8.38/2.57 # Training examples: 0 positive, 0 negative
% 8.38/2.57
% 8.38/2.57 # -------------------------------------------------
% 8.38/2.57 # User time : 0.066 s
% 8.38/2.57 # System time : 0.006 s
% 8.38/2.57 # Total time : 0.072 s
% 8.38/2.57 # Maximum resident set size: 7124 pages
% 8.38/2.57
%------------------------------------------------------------------------------