TSTP Solution File: RNG104+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG104+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:15:46 EDT 2023
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 105 ( 31 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 118 ( 43 ~; 44 |; 24 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 38 ( 0 sgn; 24 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3) )
=> sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.ayTzilfHqU/E---3.1_31908.p',mMulAsso) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.ayTzilfHqU/E---3.1_31908.p',mEOfElem) ).
fof(m__1933,hypothesis,
( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = xx )
& aElementOf0(xx,slsdtgt0(xc))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = xy )
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
file('/export/starexec/sandbox/tmp/tmp.ayTzilfHqU/E---3.1_31908.p',m__1933) ).
fof(mDefPrIdeal,axiom,
! [X1] :
( aElement0(X1)
=> ! [X2] :
( X2 = slsdtgt0(X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ? [X4] :
( aElement0(X4)
& sdtasdt0(X1,X4) = X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ayTzilfHqU/E---3.1_31908.p',mDefPrIdeal) ).
fof(m__,conjecture,
sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
file('/export/starexec/sandbox/tmp/tmp.ayTzilfHqU/E---3.1_31908.p',m__) ).
fof(m__1956,hypothesis,
( aElement0(xu)
& sdtasdt0(xc,xu) = xx ),
file('/export/starexec/sandbox/tmp/tmp.ayTzilfHqU/E---3.1_31908.p',m__1956) ).
fof(m__1905,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox/tmp/tmp.ayTzilfHqU/E---3.1_31908.p',m__1905) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.ayTzilfHqU/E---3.1_31908.p',mMulComm) ).
fof(c_0_8,plain,
! [X29,X30,X31] :
( ~ aElement0(X29)
| ~ aElement0(X30)
| ~ aElement0(X31)
| sdtasdt0(sdtasdt0(X29,X30),X31) = sdtasdt0(X29,sdtasdt0(X30,X31)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])]) ).
fof(c_0_9,plain,
! [X9,X10] :
( ~ aSet0(X9)
| ~ aElementOf0(X10,X9)
| aElement0(X10) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])]) ).
fof(c_0_10,hypothesis,
( aElement0(esk1_0)
& sdtasdt0(xc,esk1_0) = xx
& aElementOf0(xx,slsdtgt0(xc))
& aElement0(esk2_0)
& sdtasdt0(xc,esk2_0) = xy
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__1933])]) ).
fof(c_0_11,plain,
! [X15,X16,X17,X19,X20,X21,X23] :
( ( aSet0(X16)
| X16 != slsdtgt0(X15)
| ~ aElement0(X15) )
& ( aElement0(esk5_3(X15,X16,X17))
| ~ aElementOf0(X17,X16)
| X16 != slsdtgt0(X15)
| ~ aElement0(X15) )
& ( sdtasdt0(X15,esk5_3(X15,X16,X17)) = X17
| ~ aElementOf0(X17,X16)
| X16 != slsdtgt0(X15)
| ~ aElement0(X15) )
& ( ~ aElement0(X20)
| sdtasdt0(X15,X20) != X19
| aElementOf0(X19,X16)
| X16 != slsdtgt0(X15)
| ~ aElement0(X15) )
& ( ~ aElementOf0(esk6_2(X15,X21),X21)
| ~ aElement0(X23)
| sdtasdt0(X15,X23) != esk6_2(X15,X21)
| ~ aSet0(X21)
| X21 = slsdtgt0(X15)
| ~ aElement0(X15) )
& ( aElement0(esk7_2(X15,X21))
| aElementOf0(esk6_2(X15,X21),X21)
| ~ aSet0(X21)
| X21 = slsdtgt0(X15)
| ~ aElement0(X15) )
& ( sdtasdt0(X15,esk7_2(X15,X21)) = esk6_2(X15,X21)
| aElementOf0(esk6_2(X15,X21),X21)
| ~ aSet0(X21)
| X21 = slsdtgt0(X15)
| ~ aElement0(X15) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefPrIdeal])])])])])]) ).
fof(c_0_12,negated_conjecture,
sdtasdt0(xz,xx) != sdtasdt0(xc,sdtasdt0(xu,xz)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_13,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,hypothesis,
sdtasdt0(xc,xu) = xx,
inference(split_conjunct,[status(thm)],[m__1956]) ).
cnf(c_0_15,hypothesis,
aElement0(xu),
inference(split_conjunct,[status(thm)],[m__1956]) ).
cnf(c_0_16,hypothesis,
aElement0(xc),
inference(split_conjunct,[status(thm)],[m__1905]) ).
cnf(c_0_17,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,hypothesis,
aElementOf0(xx,slsdtgt0(xc)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( aSet0(X1)
| X1 != slsdtgt0(X2)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
sdtasdt0(xz,xx) != sdtasdt0(xc,sdtasdt0(xu,xz)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,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_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_22,hypothesis,
aElement0(xz),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_23,plain,
! [X27,X28] :
( ~ aElement0(X27)
| ~ aElement0(X28)
| sdtasdt0(X27,X28) = sdtasdt0(X28,X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).
cnf(c_0_24,hypothesis,
( aElement0(xx)
| ~ aSet0(slsdtgt0(xc)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( aSet0(slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
sdtasdt0(xz,xx) != sdtasdt0(xx,xz),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_27,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,hypothesis,
aElement0(xx),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG104+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n001.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 20:13:06 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.ayTzilfHqU/E---3.1_31908.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_1 with pid 31993 completed with status 0
% 0.20/0.50 # Result found by new_bool_1
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGUSF-FFMM31-SFFFFFNN
% 0.20/0.50 # partial match(1): FGHSF-FFMM31-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.20/0.50 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with pid 31996 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
% 0.20/0.50 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGUSF-FFMM31-SFFFFFNN
% 0.20/0.50 # partial match(1): FGHSF-FFMM31-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.002 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 43
% 0.20/0.50 # Removed by relevancy pruning/SinE : 20
% 0.20/0.50 # Initial clauses : 50
% 0.20/0.50 # Removed in clause preprocessing : 2
% 0.20/0.50 # Initial clauses in saturation : 48
% 0.20/0.50 # Processed clauses : 113
% 0.20/0.50 # ...of these trivial : 2
% 0.20/0.50 # ...subsumed : 5
% 0.20/0.50 # ...remaining for further processing : 106
% 0.20/0.50 # Other redundant clauses eliminated : 8
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 2
% 0.20/0.50 # Generated clauses : 120
% 0.20/0.50 # ...of the previous two non-redundant : 95
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 105
% 0.20/0.50 # Factorizations : 8
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 8
% 0.20/0.50 # Total rewrite steps : 92
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 52
% 0.20/0.50 # Positive orientable unit clauses : 17
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 2
% 0.20/0.50 # Non-unit-clauses : 33
% 0.20/0.50 # Current number of unprocessed clauses: 78
% 0.20/0.50 # ...number of literals in the above : 298
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 50
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 451
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 266
% 0.20/0.50 # Non-unit clause-clause subsumptions : 5
% 0.20/0.50 # Unit Clause-clause subsumption calls : 2
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 2
% 0.20/0.50 # BW rewrite match successes : 2
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 5025
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.012 s
% 0.20/0.50 # System time : 0.002 s
% 0.20/0.50 # Total time : 0.014 s
% 0.20/0.50 # Maximum resident set size: 1844 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.014 s
% 0.20/0.50 # System time : 0.005 s
% 0.20/0.50 # Total time : 0.019 s
% 0.20/0.50 # Maximum resident set size: 1736 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------