TSTP Solution File: COM023+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COM023+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:07:18 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 146 ( 0 equ)
% Maximal formula atoms : 44 ( 5 avg)
% Number of connectives : 213 ( 93 ~; 94 |; 22 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-4 aty)
% Number of variables : 36 ( 0 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
isConfluent0(xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mCRDef,axiom,
! [X1] :
( aRewritingSystem0(X1)
=> ( isConfluent0(X1)
<=> ! [X2,X3,X4] :
( ( aElement0(X2)
& aElement0(X3)
& aElement0(X4)
& sdtmndtasgtdt0(X2,X1,X3)
& sdtmndtasgtdt0(X2,X1,X4) )
=> ? [X5] :
( aElement0(X5)
& sdtmndtasgtdt0(X3,X1,X5)
& sdtmndtasgtdt0(X4,X1,X5) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCRDef) ).
fof(m__715,hypothesis,
! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3)
& sdtmndtasgtdt0(X1,xR,X2)
& sdtmndtasgtdt0(X1,xR,X3) )
=> ? [X4] :
( aElement0(X4)
& sdtmndtasgtdt0(X2,xR,X4)
& sdtmndtasgtdt0(X3,xR,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__715) ).
fof(m__656,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656) ).
fof(c_0_4,negated_conjecture,
~ isConfluent0(xR),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_5,plain,
! [X6,X7,X8,X9,X14] :
( ( aElement0(esk1_4(X6,X7,X8,X9))
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aElement0(X9)
| ~ sdtmndtasgtdt0(X7,X6,X8)
| ~ sdtmndtasgtdt0(X7,X6,X9)
| ~ isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( sdtmndtasgtdt0(X8,X6,esk1_4(X6,X7,X8,X9))
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aElement0(X9)
| ~ sdtmndtasgtdt0(X7,X6,X8)
| ~ sdtmndtasgtdt0(X7,X6,X9)
| ~ isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( sdtmndtasgtdt0(X9,X6,esk1_4(X6,X7,X8,X9))
| ~ aElement0(X7)
| ~ aElement0(X8)
| ~ aElement0(X9)
| ~ sdtmndtasgtdt0(X7,X6,X8)
| ~ sdtmndtasgtdt0(X7,X6,X9)
| ~ isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( aElement0(esk2_1(X6))
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( aElement0(esk3_1(X6))
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( aElement0(esk4_1(X6))
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( sdtmndtasgtdt0(esk2_1(X6),X6,esk3_1(X6))
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( sdtmndtasgtdt0(esk2_1(X6),X6,esk4_1(X6))
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) )
& ( ~ aElement0(X14)
| ~ sdtmndtasgtdt0(esk3_1(X6),X6,X14)
| ~ sdtmndtasgtdt0(esk4_1(X6),X6,X14)
| isConfluent0(X6)
| ~ aRewritingSystem0(X6) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCRDef])])])])])]) ).
fof(c_0_6,hypothesis,
! [X15,X16,X17] :
( ( aElement0(esk5_3(X15,X16,X17))
| ~ aElement0(X15)
| ~ aElement0(X16)
| ~ aElement0(X17)
| ~ sdtmndtasgtdt0(X15,xR,X16)
| ~ sdtmndtasgtdt0(X15,xR,X17) )
& ( sdtmndtasgtdt0(X16,xR,esk5_3(X15,X16,X17))
| ~ aElement0(X15)
| ~ aElement0(X16)
| ~ aElement0(X17)
| ~ sdtmndtasgtdt0(X15,xR,X16)
| ~ sdtmndtasgtdt0(X15,xR,X17) )
& ( sdtmndtasgtdt0(X17,xR,esk5_3(X15,X16,X17))
| ~ aElement0(X15)
| ~ aElement0(X16)
| ~ aElement0(X17)
| ~ sdtmndtasgtdt0(X15,xR,X16)
| ~ sdtmndtasgtdt0(X15,xR,X17) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__715])])])])]) ).
fof(c_0_7,negated_conjecture,
~ isConfluent0(xR),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( isConfluent0(X2)
| ~ aElement0(X1)
| ~ sdtmndtasgtdt0(esk3_1(X2),X2,X1)
| ~ sdtmndtasgtdt0(esk4_1(X2),X2,X1)
| ~ aRewritingSystem0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
( sdtmndtasgtdt0(X1,xR,esk5_3(X2,X3,X1))
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1)
| ~ sdtmndtasgtdt0(X2,xR,X3)
| ~ sdtmndtasgtdt0(X2,xR,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__656]) ).
cnf(c_0_11,negated_conjecture,
~ isConfluent0(xR),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
( aElement0(esk5_3(X1,X2,X3))
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aElement0(X3)
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ sdtmndtasgtdt0(X1,xR,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,hypothesis,
( ~ sdtmndtasgtdt0(esk3_1(xR),xR,esk5_3(X1,X2,esk4_1(xR)))
| ~ sdtmndtasgtdt0(X1,xR,esk4_1(xR))
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ aElement0(esk4_1(xR))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]),c_0_11]),c_0_12]) ).
cnf(c_0_14,hypothesis,
( sdtmndtasgtdt0(X1,xR,esk5_3(X2,X1,X3))
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aElement0(X3)
| ~ sdtmndtasgtdt0(X2,xR,X1)
| ~ sdtmndtasgtdt0(X2,xR,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,hypothesis,
( ~ sdtmndtasgtdt0(X1,xR,esk4_1(xR))
| ~ sdtmndtasgtdt0(X1,xR,esk3_1(xR))
| ~ aElement0(esk4_1(xR))
| ~ aElement0(esk3_1(xR))
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( sdtmndtasgtdt0(esk2_1(X1),X1,esk4_1(X1))
| isConfluent0(X1)
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,hypothesis,
( ~ sdtmndtasgtdt0(esk2_1(xR),xR,esk3_1(xR))
| ~ aElement0(esk4_1(xR))
| ~ aElement0(esk3_1(xR))
| ~ aElement0(esk2_1(xR)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_10])]),c_0_11]) ).
cnf(c_0_18,plain,
( sdtmndtasgtdt0(esk2_1(X1),X1,esk3_1(X1))
| isConfluent0(X1)
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,hypothesis,
( ~ aElement0(esk4_1(xR))
| ~ aElement0(esk3_1(xR))
| ~ aElement0(esk2_1(xR)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_10])]),c_0_11]) ).
cnf(c_0_20,plain,
( aElement0(esk4_1(X1))
| isConfluent0(X1)
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,hypothesis,
( ~ aElement0(esk3_1(xR))
| ~ aElement0(esk2_1(xR)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_10])]),c_0_11]) ).
cnf(c_0_22,plain,
( aElement0(esk3_1(X1))
| isConfluent0(X1)
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,hypothesis,
~ aElement0(esk2_1(xR)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_10])]),c_0_11]) ).
cnf(c_0_24,plain,
( aElement0(esk2_1(X1))
| isConfluent0(X1)
| ~ aRewritingSystem0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_10])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : COM023+1 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n025.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 10:23:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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/benchmark/theBenchmark.p
% 0.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # sh5l with pid 19205 completed with status 0
% 0.21/0.52 # Result found by sh5l
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FGHSF-FFMS31-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 148s (1) cores
% 0.21/0.52 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 19206 completed with status 0
% 0.21/0.52 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FGHSF-FFMS31-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 148s (1) cores
% 0.21/0.52 # Preprocessing time : 0.002 s
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 18
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 50
% 0.21/0.52 # Removed in clause preprocessing : 4
% 0.21/0.52 # Initial clauses in saturation : 46
% 0.21/0.52 # Processed clauses : 59
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 2
% 0.21/0.52 # ...remaining for further processing : 57
% 0.21/0.52 # Other redundant clauses eliminated : 1
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 3
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 58
% 0.21/0.52 # ...of the previous two non-redundant : 48
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 11
% 0.21/0.52 # Paramodulations : 57
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 1
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 14
% 0.21/0.52 # ...of those cached : 12
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 53
% 0.21/0.52 # Positive orientable unit clauses : 3
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 2
% 0.21/0.52 # Non-unit-clauses : 48
% 0.21/0.52 # Current number of unprocessed clauses: 35
% 0.21/0.52 # ...number of literals in the above : 256
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 3
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 302
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 58
% 0.21/0.52 # Non-unit clause-clause subsumptions : 15
% 0.21/0.52 # Unit Clause-clause subsumption calls : 7
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 0
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 5775
% 0.21/0.52 # Search garbage collected termcells : 1138
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.011 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.014 s
% 0.21/0.52 # Maximum resident set size: 1848 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.012 s
% 0.21/0.52 # System time : 0.006 s
% 0.21/0.52 # Total time : 0.018 s
% 0.21/0.52 # Maximum resident set size: 1712 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------