TSTP Solution File: COM021+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : COM021+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:22:21 EDT 2023
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 15 unt; 0 def)
% Number of atoms : 127 ( 5 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 166 ( 67 ~; 71 |; 22 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 37 ( 2 sgn; 21 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mNFRDef,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aRewritingSystem0(X2) )
=> ! [X3] :
( aNormalFormOfIn0(X3,X1,X2)
<=> ( aElement0(X3)
& sdtmndtasgtdt0(X1,X2,X3)
& ~ ? [X4] : aReductOfIn0(X4,X3,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nlqtUbqUKa/E---3.1_17653.p',mNFRDef) ).
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/sandbox/tmp/tmp.nlqtUbqUKa/E---3.1_17653.p',mTCRDef) ).
fof(m__818,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
file('/export/starexec/sandbox/tmp/tmp.nlqtUbqUKa/E---3.1_17653.p',m__818) ).
fof(m__656,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/tmp/tmp.nlqtUbqUKa/E---3.1_17653.p',m__656) ).
fof(m__799,hypothesis,
( aElement0(xw)
& sdtmndtasgtdt0(xu,xR,xw)
& sdtmndtasgtdt0(xv,xR,xw) ),
file('/export/starexec/sandbox/tmp/tmp.nlqtUbqUKa/E---3.1_17653.p',m__799) ).
fof(m__,conjecture,
sdtmndtasgtdt0(xb,xR,xd),
file('/export/starexec/sandbox/tmp/tmp.nlqtUbqUKa/E---3.1_17653.p',m__) ).
fof(m__850,hypothesis,
( aElement0(xx)
& sdtmndtasgtdt0(xb,xR,xx)
& sdtmndtasgtdt0(xd,xR,xx) ),
file('/export/starexec/sandbox/tmp/tmp.nlqtUbqUKa/E---3.1_17653.p',m__850) ).
fof(mTCDef,axiom,
! [X1,X2,X3] :
( ( aElement0(X1)
& aRewritingSystem0(X2)
& aElement0(X3) )
=> ( sdtmndtplgtdt0(X1,X2,X3)
<=> ( aReductOfIn0(X3,X1,X2)
| ? [X4] :
( aElement0(X4)
& aReductOfIn0(X4,X1,X2)
& sdtmndtplgtdt0(X4,X2,X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nlqtUbqUKa/E---3.1_17653.p',mTCDef) ).
fof(c_0_8,plain,
! [X46,X47,X48,X49,X50] :
( ( aElement0(X48)
| ~ aNormalFormOfIn0(X48,X46,X47)
| ~ aElement0(X46)
| ~ aRewritingSystem0(X47) )
& ( sdtmndtasgtdt0(X46,X47,X48)
| ~ aNormalFormOfIn0(X48,X46,X47)
| ~ aElement0(X46)
| ~ aRewritingSystem0(X47) )
& ( ~ aReductOfIn0(X49,X48,X47)
| ~ aNormalFormOfIn0(X48,X46,X47)
| ~ aElement0(X46)
| ~ aRewritingSystem0(X47) )
& ( ~ aElement0(X50)
| ~ sdtmndtasgtdt0(X46,X47,X50)
| aReductOfIn0(esk10_3(X46,X47,X50),X50,X47)
| aNormalFormOfIn0(X50,X46,X47)
| ~ aElement0(X46)
| ~ aRewritingSystem0(X47) ) ),
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)],[mNFRDef])])])])])]) ).
fof(c_0_9,plain,
! [X40,X41,X42] :
( ( ~ sdtmndtasgtdt0(X40,X41,X42)
| X40 = X42
| sdtmndtplgtdt0(X40,X41,X42)
| ~ aElement0(X40)
| ~ aRewritingSystem0(X41)
| ~ aElement0(X42) )
& ( X40 != X42
| sdtmndtasgtdt0(X40,X41,X42)
| ~ aElement0(X40)
| ~ aRewritingSystem0(X41)
| ~ aElement0(X42) )
& ( ~ sdtmndtplgtdt0(X40,X41,X42)
| sdtmndtasgtdt0(X40,X41,X42)
| ~ aElement0(X40)
| ~ aRewritingSystem0(X41)
| ~ aElement0(X42) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCRDef])])]) ).
cnf(c_0_10,plain,
( aElement0(X1)
| ~ aNormalFormOfIn0(X1,X2,X3)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
inference(split_conjunct,[status(thm)],[m__818]) ).
cnf(c_0_12,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__656]) ).
cnf(c_0_13,hypothesis,
aElement0(xw),
inference(split_conjunct,[status(thm)],[m__799]) ).
fof(c_0_14,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_15,plain,
( X1 = X3
| sdtmndtplgtdt0(X1,X2,X3)
| ~ sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,hypothesis,
sdtmndtasgtdt0(xd,xR,xx),
inference(split_conjunct,[status(thm)],[m__850]) ).
cnf(c_0_17,hypothesis,
aElement0(xx),
inference(split_conjunct,[status(thm)],[m__850]) ).
cnf(c_0_18,hypothesis,
aElement0(xd),
inference(cn,[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])]) ).
fof(c_0_19,plain,
! [X31,X32,X33,X35] :
( ( aElement0(esk9_3(X31,X32,X33))
| aReductOfIn0(X33,X31,X32)
| ~ sdtmndtplgtdt0(X31,X32,X33)
| ~ aElement0(X31)
| ~ aRewritingSystem0(X32)
| ~ aElement0(X33) )
& ( aReductOfIn0(esk9_3(X31,X32,X33),X31,X32)
| aReductOfIn0(X33,X31,X32)
| ~ sdtmndtplgtdt0(X31,X32,X33)
| ~ aElement0(X31)
| ~ aRewritingSystem0(X32)
| ~ aElement0(X33) )
& ( sdtmndtplgtdt0(esk9_3(X31,X32,X33),X32,X33)
| aReductOfIn0(X33,X31,X32)
| ~ sdtmndtplgtdt0(X31,X32,X33)
| ~ aElement0(X31)
| ~ aRewritingSystem0(X32)
| ~ aElement0(X33) )
& ( ~ aReductOfIn0(X33,X31,X32)
| sdtmndtplgtdt0(X31,X32,X33)
| ~ aElement0(X31)
| ~ aRewritingSystem0(X32)
| ~ aElement0(X33) )
& ( ~ aElement0(X35)
| ~ aReductOfIn0(X35,X31,X32)
| ~ sdtmndtplgtdt0(X35,X32,X33)
| sdtmndtplgtdt0(X31,X32,X33)
| ~ aElement0(X31)
| ~ aRewritingSystem0(X32)
| ~ aElement0(X33) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTCDef])])])])]) ).
cnf(c_0_20,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,hypothesis,
( xd = xx
| sdtmndtplgtdt0(xd,xR,xx) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[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_17])]),c_0_18])]) ).
cnf(c_0_22,hypothesis,
sdtmndtasgtdt0(xb,xR,xx),
inference(split_conjunct,[status(thm)],[m__850]) ).
cnf(c_0_23,plain,
( ~ aReductOfIn0(X1,X2,X3)
| ~ aNormalFormOfIn0(X2,X4,X3)
| ~ aElement0(X4)
| ~ aRewritingSystem0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,plain,
( aReductOfIn0(esk9_3(X1,X2,X3),X1,X2)
| aReductOfIn0(X3,X1,X2)
| ~ sdtmndtplgtdt0(X1,X2,X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
sdtmndtplgtdt0(xd,xR,xx),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_26,hypothesis,
~ aReductOfIn0(X1,xd,xR),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_12]),c_0_17]),c_0_18])]),c_0_26]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM021+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 04:27:41 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 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.nlqtUbqUKa/E---3.1_17653.p
% 0.21/0.51 # Version: 3.1pre001
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # new_bool_1 with pid 17748 completed with status 0
% 0.21/0.51 # Result found by new_bool_1
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.21/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 17759 completed with status 0
% 0.21/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 25
% 0.21/0.51 # Removed by relevancy pruning/SinE : 1
% 0.21/0.51 # Initial clauses : 59
% 0.21/0.51 # Removed in clause preprocessing : 4
% 0.21/0.51 # Initial clauses in saturation : 55
% 0.21/0.51 # Processed clauses : 148
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 148
% 0.21/0.51 # Other redundant clauses eliminated : 1
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 1
% 0.21/0.51 # Generated clauses : 179
% 0.21/0.51 # ...of the previous two non-redundant : 140
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 10
% 0.21/0.51 # Paramodulations : 178
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 1
% 0.21/0.51 # Total rewrite steps : 337
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 91
% 0.21/0.51 # Positive orientable unit clauses : 34
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 2
% 0.21/0.51 # Non-unit-clauses : 55
% 0.21/0.51 # Current number of unprocessed clauses: 102
% 0.21/0.51 # ...number of literals in the above : 306
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 56
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 632
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 178
% 0.21/0.51 # Non-unit clause-clause subsumptions : 10
% 0.21/0.51 # Unit Clause-clause subsumption calls : 135
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 20
% 0.21/0.51 # BW rewrite match successes : 1
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 7090
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.015 s
% 0.21/0.51 # System time : 0.002 s
% 0.21/0.51 # Total time : 0.017 s
% 0.21/0.51 # Maximum resident set size: 1872 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.017 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.021 s
% 0.21/0.51 # Maximum resident set size: 1704 pages
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------