TSTP Solution File: COM012+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : COM012+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 17:21:15 EDT 2023
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 120 ( 22 equ)
% Maximal formula atoms : 31 ( 5 avg)
% Number of connectives : 123 ( 25 ~; 51 |; 43 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 20 ( 0 sgn; 9 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( ( xx = xy
| ( ( aReductOfIn0(xy,xx,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xx,xR)
& sdtmndtplgtdt0(X1,xR,xy) ) )
& sdtmndtplgtdt0(xx,xR,xy) ) )
& sdtmndtasgtdt0(xx,xR,xy)
& ( xy = xz
| ( ( aReductOfIn0(xz,xy,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xy,xR)
& sdtmndtplgtdt0(X1,xR,xz) ) )
& sdtmndtplgtdt0(xy,xR,xz) ) )
& sdtmndtasgtdt0(xy,xR,xz) )
=> ( xx = xz
| aReductOfIn0(xz,xx,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xx,xR)
& sdtmndtplgtdt0(X1,xR,xz) )
| sdtmndtplgtdt0(xx,xR,xz)
| sdtmndtasgtdt0(xx,xR,xz) ) ),
file('/export/starexec/sandbox/tmp/tmp.r9delgySox/E---3.1_11122.p',m__) ).
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/sandbox/tmp/tmp.r9delgySox/E---3.1_11122.p',mTCTrans) ).
fof(m__349,hypothesis,
( aElement0(xx)
& aRewritingSystem0(xR)
& aElement0(xy)
& aElement0(xz) ),
file('/export/starexec/sandbox/tmp/tmp.r9delgySox/E---3.1_11122.p',m__349) ).
fof(c_0_3,negated_conjecture,
~ ( ( ( xx = xy
| ( ( aReductOfIn0(xy,xx,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xx,xR)
& sdtmndtplgtdt0(X1,xR,xy) ) )
& sdtmndtplgtdt0(xx,xR,xy) ) )
& sdtmndtasgtdt0(xx,xR,xy)
& ( xy = xz
| ( ( aReductOfIn0(xz,xy,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xy,xR)
& sdtmndtplgtdt0(X1,xR,xz) ) )
& sdtmndtplgtdt0(xy,xR,xz) ) )
& sdtmndtasgtdt0(xy,xR,xz) )
=> ( xx = xz
| aReductOfIn0(xz,xx,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xx,xR)
& sdtmndtplgtdt0(X1,xR,xz) )
| sdtmndtplgtdt0(xx,xR,xz)
| sdtmndtasgtdt0(xx,xR,xz) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCTrans])]) ).
fof(c_0_5,negated_conjecture,
! [X22] :
( ( aElement0(esk2_0)
| aReductOfIn0(xy,xx,xR)
| xx = xy )
& ( aReductOfIn0(esk2_0,xx,xR)
| aReductOfIn0(xy,xx,xR)
| xx = xy )
& ( sdtmndtplgtdt0(esk2_0,xR,xy)
| aReductOfIn0(xy,xx,xR)
| xx = xy )
& ( sdtmndtplgtdt0(xx,xR,xy)
| xx = xy )
& sdtmndtasgtdt0(xx,xR,xy)
& ( aElement0(esk3_0)
| aReductOfIn0(xz,xy,xR)
| xy = xz )
& ( aReductOfIn0(esk3_0,xy,xR)
| aReductOfIn0(xz,xy,xR)
| xy = xz )
& ( sdtmndtplgtdt0(esk3_0,xR,xz)
| aReductOfIn0(xz,xy,xR)
| xy = xz )
& ( sdtmndtplgtdt0(xy,xR,xz)
| xy = xz )
& sdtmndtasgtdt0(xy,xR,xz)
& xx != xz
& ~ aReductOfIn0(xz,xx,xR)
& ( ~ aElement0(X22)
| ~ aReductOfIn0(X22,xx,xR)
| ~ sdtmndtplgtdt0(X22,xR,xz) )
& ~ sdtmndtplgtdt0(xx,xR,xz)
& ~ sdtmndtasgtdt0(xx,xR,xz) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_6,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_7,negated_conjecture,
( sdtmndtplgtdt0(xy,xR,xz)
| xy = xz ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_9,hypothesis,
aElement0(xz),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_10,hypothesis,
aElement0(xy),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_11,negated_conjecture,
~ sdtmndtplgtdt0(xx,xR,xz),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,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_6,c_0_7]),c_0_8]),c_0_9]),c_0_10])]) ).
cnf(c_0_13,hypothesis,
aElement0(xx),
inference(split_conjunct,[status(thm)],[m__349]) ).
cnf(c_0_14,negated_conjecture,
( xz = xy
| ~ sdtmndtplgtdt0(xx,xR,xy) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_15,negated_conjecture,
( sdtmndtplgtdt0(xx,xR,xy)
| xx = xy ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
~ sdtmndtasgtdt0(xx,xR,xz),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
( xx = xy
| xz = xy ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
sdtmndtasgtdt0(xy,xR,xz),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,negated_conjecture,
xz = xy,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_20,negated_conjecture,
sdtmndtasgtdt0(xx,xR,xy),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : COM012+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n015.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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 05:17:31 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.r9delgySox/E---3.1_11122.p
% 0.20/0.49 # Version: 3.1pre001
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11200 completed with status 0
% 0.20/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FGHSF-FFMM33-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting G-E--_301_C18_F1_URBAN_S0Y with 811s (1) cores
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.20/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.49 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 11207 completed with status 0
% 0.20/0.49 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FGHSF-FFMM33-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting G-E--_301_C18_F1_URBAN_S0Y with 811s (1) cores
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.20/0.49 # Preprocessing time : 0.002 s
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 10
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 33
% 0.20/0.49 # Removed in clause preprocessing : 4
% 0.20/0.49 # Initial clauses in saturation : 29
% 0.20/0.49 # Processed clauses : 61
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 13
% 0.20/0.49 # ...remaining for further processing : 48
% 0.20/0.49 # Other redundant clauses eliminated : 1
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 2
% 0.20/0.49 # Backward-rewritten : 23
% 0.20/0.49 # Generated clauses : 69
% 0.20/0.49 # ...of the previous two non-redundant : 67
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 4
% 0.20/0.49 # Paramodulations : 68
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 1
% 0.20/0.49 # Total rewrite steps : 124
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 22
% 0.20/0.49 # Positive orientable unit clauses : 5
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 0
% 0.20/0.49 # Non-unit-clauses : 17
% 0.20/0.49 # Current number of unprocessed clauses: 27
% 0.20/0.49 # ...number of literals in the above : 138
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 25
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 126
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 32
% 0.20/0.49 # Non-unit clause-clause subsumptions : 18
% 0.20/0.49 # Unit Clause-clause subsumption calls : 4
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 2
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 3075
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.008 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.010 s
% 0.20/0.49 # Maximum resident set size: 1764 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.028 s
% 0.20/0.49 # System time : 0.008 s
% 0.20/0.49 # Total time : 0.037 s
% 0.20/0.49 # Maximum resident set size: 1688 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------