TSTP Solution File: COM012+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COM012+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 : 300s
% DateTime : Mon May 20 19:08:15 EDT 2024
% Result : Theorem 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 9 unt; 0 def)
% Number of atoms : 99 ( 12 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 121 ( 47 ~; 53 |; 15 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 31 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mTCTrans,axiom,
! [X1,X2,X3,X4] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3)
& aElement0(X4) )
=> ( ( sdtmndtplgtdt0(X1,X2,X3)
& sdtmndtplgtdt0(X3,X2,X4) )
=> sdtmndtplgtdt0(X1,X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTCTrans) ).
fof(mTCRDef,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3) )
=> ( sdtmndtasgtdt0(X1,X2,X3)
<=> ( X1 = X3
| sdtmndtplgtdt0(X1,X2,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mTCRDef) ).
fof(m__,conjecture,
( ( sdtmndtasgtdt0(xx,xR,xy)
& sdtmndtasgtdt0(xy,xR,xz) )
=> sdtmndtasgtdt0(xx,xR,xz) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__349,hypothesis,
( aElement0(xx)
& aRewritingSystem0(xR)
& aElement0(xy)
& aElement0(xz) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__349) ).
fof(c_0_4,plain,
! [X13,X14,X15,X16] :
( ~ aElement0(X13)
| ~ aRewritingSystem0(X14)
| ~ aElement0(X15)
| ~ aElement0(X16)
| ~ sdtmndtplgtdt0(X13,X14,X15)
| ~ sdtmndtplgtdt0(X15,X14,X16)
| sdtmndtplgtdt0(X13,X14,X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCTrans])])]) ).
fof(c_0_5,plain,
! [X7,X8,X9] :
( ( ~ sdtmndtasgtdt0(X7,X8,X9)
| X7 = X9
| sdtmndtplgtdt0(X7,X8,X9)
| ~ aElement0(X7)
| ~ aRewritingSystem0(X8)
| ~ aElement0(X9) )
& ( X7 != X9
| sdtmndtasgtdt0(X7,X8,X9)
| ~ aElement0(X7)
| ~ aRewritingSystem0(X8)
| ~ aElement0(X9) )
& ( ~ sdtmndtplgtdt0(X7,X8,X9)
| sdtmndtasgtdt0(X7,X8,X9)
| ~ aElement0(X7)
| ~ aRewritingSystem0(X8)
| ~ aElement0(X9) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCRDef])])])]) ).
fof(c_0_6,negated_conjecture,
~ ( ( sdtmndtasgtdt0(xx,xR,xy)
& sdtmndtasgtdt0(xy,xR,xz) )
=> sdtmndtasgtdt0(xx,xR,xz) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_7,plain,
( sdtmndtplgtdt0(X1,X2,X4)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3)
| ~ aElement0(X4)
| ~ sdtmndtplgtdt0(X1,X2,X3)
| ~ sdtmndtplgtdt0(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( X1 = X3
| sdtmndtplgtdt0(X1,X2,X3)
| ~ sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
( sdtmndtasgtdt0(xx,xR,xy)
& sdtmndtasgtdt0(xy,xR,xz)
& ~ sdtmndtasgtdt0(xx,xR,xz) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
cnf(c_0_10,plain,
( X1 = X2
| sdtmndtplgtdt0(X3,X4,X2)
| ~ sdtmndtasgtdt0(X1,X4,X2)
| ~ sdtmndtplgtdt0(X3,X4,X1)
| ~ aRewritingSystem0(X4)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aElement0(X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
sdtmndtasgtdt0(xy,xR,xz),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_13,hypothesis,
aElement0(xz),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_14,hypothesis,
aElement0(xy),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_15,plain,
( sdtmndtasgtdt0(X1,X2,X3)
| ~ sdtmndtplgtdt0(X1,X2,X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( xz = xy
| sdtmndtplgtdt0(X1,xR,xz)
| ~ sdtmndtplgtdt0(X1,xR,xy)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
( xz = xy
| sdtmndtasgtdt0(X1,xR,xz)
| ~ sdtmndtplgtdt0(X1,xR,xy)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12]),c_0_13])]) ).
cnf(c_0_18,negated_conjecture,
~ sdtmndtasgtdt0(xx,xR,xz),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
( xz = xy
| X1 = xy
| sdtmndtasgtdt0(X1,xR,xz)
| ~ sdtmndtasgtdt0(X1,xR,xy)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_8]),c_0_12]),c_0_14])]) ).
cnf(c_0_20,negated_conjecture,
sdtmndtasgtdt0(xx,xR,xy),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,hypothesis,
aElement0(xx),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_22,negated_conjecture,
( xx = xy
| xz = xy ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_23,negated_conjecture,
xz = xy,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_22]),c_0_11])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_23]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : COM012+1 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n027.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 : 300
% 0.12/0.33 % DateTime : Sun May 19 10:33:07 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order model finding
% 0.18/0.45 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.18/0.47 # Version: 3.1.0
% 0.18/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # new_bool_3 with pid 19297 completed with status 0
% 0.18/0.47 # Result found by new_bool_3
% 0.18/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FGUSF-FFSM00-SFFFFFNN
% 0.18/0.47 # partial match(1): FGUNF-FFSM00-SFFFFFNN
% 0.18/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting new_ho_10 with 55s (1) cores
% 0.18/0.47 # new_ho_10 with pid 19300 completed with status 0
% 0.18/0.47 # Result found by new_ho_10
% 0.18/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FGUSF-FFSM00-SFFFFFNN
% 0.18/0.47 # partial match(1): FGUNF-FFSM00-SFFFFFNN
% 0.18/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting new_ho_10 with 55s (1) cores
% 0.18/0.47 # Preprocessing time : 0.001 s
% 0.18/0.47 # Presaturation interreduction done
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Theorem
% 0.18/0.47 # SZS output start CNFRefutation
% See solution above
% 0.18/0.47 # Parsed axioms : 10
% 0.18/0.47 # Removed by relevancy pruning/SinE : 3
% 0.18/0.47 # Initial clauses : 14
% 0.18/0.47 # Removed in clause preprocessing : 3
% 0.18/0.47 # Initial clauses in saturation : 11
% 0.18/0.47 # Processed clauses : 35
% 0.18/0.47 # ...of these trivial : 0
% 0.18/0.47 # ...subsumed : 0
% 0.18/0.47 # ...remaining for further processing : 35
% 0.18/0.47 # Other redundant clauses eliminated : 1
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 1
% 0.18/0.47 # Backward-rewritten : 8
% 0.18/0.47 # Generated clauses : 22
% 0.18/0.47 # ...of the previous two non-redundant : 19
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 0
% 0.18/0.47 # Paramodulations : 21
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 1
% 0.18/0.47 # Disequality decompositions : 0
% 0.18/0.47 # Total rewrite steps : 40
% 0.18/0.47 # ...of those cached : 33
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 14
% 0.18/0.47 # Positive orientable unit clauses : 5
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 0
% 0.18/0.47 # Non-unit-clauses : 9
% 0.18/0.47 # Current number of unprocessed clauses: 6
% 0.18/0.47 # ...number of literals in the above : 39
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 20
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 51
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 15
% 0.18/0.47 # Non-unit clause-clause subsumptions : 1
% 0.18/0.47 # Unit Clause-clause subsumption calls : 0
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 3
% 0.18/0.47 # BW rewrite match successes : 1
% 0.18/0.47 # Condensation attempts : 35
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 1808
% 0.18/0.47 # Search garbage collected termcells : 205
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.007 s
% 0.18/0.47 # System time : 0.001 s
% 0.18/0.47 # Total time : 0.008 s
% 0.18/0.47 # Maximum resident set size: 1716 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.009 s
% 0.18/0.47 # System time : 0.002 s
% 0.18/0.47 # Total time : 0.011 s
% 0.18/0.47 # Maximum resident set size: 1700 pages
% 0.18/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------