TSTP Solution File: COM018+4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : COM018+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:20 EDT 2023
% Result : Theorem 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 222 ( 23 equ)
% Maximal formula atoms : 96 ( 13 avg)
% Number of connectives : 295 ( 89 ~; 132 |; 69 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 34 ( 1 sgn; 18 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( ( aElement0(X1)
& ( xw = X1
| aReductOfIn0(X1,xw,xR)
| ? [X2] :
( aElement0(X2)
& aReductOfIn0(X2,xw,xR)
& sdtmndtplgtdt0(X2,xR,X1) )
| sdtmndtplgtdt0(xw,xR,X1)
| sdtmndtasgtdt0(xw,xR,X1) )
& ~ ? [X2] : aReductOfIn0(X2,X1,xR) )
| aNormalFormOfIn0(X1,xw,xR) ),
file('/export/starexec/sandbox/tmp/tmp.XOtG6lPalP/E---3.1_2640.p',m__) ).
fof(mTermNF,axiom,
! [X1] :
( ( aRewritingSystem0(X1)
& isTerminating0(X1) )
=> ! [X2] :
( aElement0(X2)
=> ? [X3] : aNormalFormOfIn0(X3,X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.XOtG6lPalP/E---3.1_2640.p',mTermNF) ).
fof(m__656_01,hypothesis,
( ! [X1,X2,X3] :
( ( aElement0(X1)
& aElement0(X2)
& aElement0(X3)
& aReductOfIn0(X2,X1,xR)
& aReductOfIn0(X3,X1,xR) )
=> ? [X4] :
( aElement0(X4)
& ( X2 = X4
| ( ( aReductOfIn0(X4,X2,xR)
| ? [X5] :
( aElement0(X5)
& aReductOfIn0(X5,X2,xR)
& sdtmndtplgtdt0(X5,xR,X4) ) )
& sdtmndtplgtdt0(X2,xR,X4) ) )
& sdtmndtasgtdt0(X2,xR,X4)
& ( X3 = X4
| ( ( aReductOfIn0(X4,X3,xR)
| ? [X5] :
( aElement0(X5)
& aReductOfIn0(X5,X3,xR)
& sdtmndtplgtdt0(X5,xR,X4) ) )
& sdtmndtplgtdt0(X3,xR,X4) ) )
& sdtmndtasgtdt0(X3,xR,X4) ) )
& isLocallyConfluent0(xR)
& ! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> ( ( aReductOfIn0(X2,X1,xR)
| ? [X3] :
( aElement0(X3)
& aReductOfIn0(X3,X1,xR)
& sdtmndtplgtdt0(X3,xR,X2) )
| sdtmndtplgtdt0(X1,xR,X2) )
=> iLess0(X2,X1) ) )
& isTerminating0(xR) ),
file('/export/starexec/sandbox/tmp/tmp.XOtG6lPalP/E---3.1_2640.p',m__656_01) ).
fof(m__799,hypothesis,
( aElement0(xw)
& ( xu = xw
| ( ( aReductOfIn0(xw,xu,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xu,xR)
& sdtmndtplgtdt0(X1,xR,xw) ) )
& sdtmndtplgtdt0(xu,xR,xw) ) )
& sdtmndtasgtdt0(xu,xR,xw)
& ( xv = xw
| ( ( aReductOfIn0(xw,xv,xR)
| ? [X1] :
( aElement0(X1)
& aReductOfIn0(X1,xv,xR)
& sdtmndtplgtdt0(X1,xR,xw) ) )
& sdtmndtplgtdt0(xv,xR,xw) ) )
& sdtmndtasgtdt0(xv,xR,xw) ),
file('/export/starexec/sandbox/tmp/tmp.XOtG6lPalP/E---3.1_2640.p',m__799) ).
fof(m__656,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/tmp/tmp.XOtG6lPalP/E---3.1_2640.p',m__656) ).
fof(c_0_5,negated_conjecture,
~ ? [X1] :
( ( aElement0(X1)
& ( xw = X1
| aReductOfIn0(X1,xw,xR)
| ? [X2] :
( aElement0(X2)
& aReductOfIn0(X2,xw,xR)
& sdtmndtplgtdt0(X2,xR,X1) )
| sdtmndtplgtdt0(xw,xR,X1)
| sdtmndtasgtdt0(xw,xR,X1) )
& ~ ? [X2] : aReductOfIn0(X2,X1,xR) )
| aNormalFormOfIn0(X1,xw,xR) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
! [X80,X81,X83] :
( ( xw != X80
| ~ aElement0(X80)
| aReductOfIn0(esk26_1(X80),X80,xR) )
& ( ~ aReductOfIn0(X80,xw,xR)
| ~ aElement0(X80)
| aReductOfIn0(esk26_1(X80),X80,xR) )
& ( ~ aElement0(X81)
| ~ aReductOfIn0(X81,xw,xR)
| ~ sdtmndtplgtdt0(X81,xR,X80)
| ~ aElement0(X80)
| aReductOfIn0(esk26_1(X80),X80,xR) )
& ( ~ sdtmndtplgtdt0(xw,xR,X80)
| ~ aElement0(X80)
| aReductOfIn0(esk26_1(X80),X80,xR) )
& ( ~ sdtmndtasgtdt0(xw,xR,X80)
| ~ aElement0(X80)
| aReductOfIn0(esk26_1(X80),X80,xR) )
& ~ aNormalFormOfIn0(X83,xw,xR) ),
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)],[c_0_5])])])])])]) ).
fof(c_0_7,plain,
! [X54,X55] :
( ~ aRewritingSystem0(X54)
| ~ isTerminating0(X54)
| ~ aElement0(X55)
| aNormalFormOfIn0(esk13_2(X54,X55),X55,X54) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mTermNF])])])]) ).
fof(c_0_8,hypothesis,
! [X57,X58,X59,X63,X64,X65] :
( ( aElement0(esk14_3(X57,X58,X59))
| ~ aElement0(X57)
| ~ aElement0(X58)
| ~ aElement0(X59)
| ~ aReductOfIn0(X58,X57,xR)
| ~ aReductOfIn0(X59,X57,xR) )
& ( aElement0(esk15_3(X57,X58,X59))
| aReductOfIn0(esk14_3(X57,X58,X59),X58,xR)
| X58 = esk14_3(X57,X58,X59)
| ~ aElement0(X57)
| ~ aElement0(X58)
| ~ aElement0(X59)
| ~ aReductOfIn0(X58,X57,xR)
| ~ aReductOfIn0(X59,X57,xR) )
& ( aReductOfIn0(esk15_3(X57,X58,X59),X58,xR)
| aReductOfIn0(esk14_3(X57,X58,X59),X58,xR)
| X58 = esk14_3(X57,X58,X59)
| ~ aElement0(X57)
| ~ aElement0(X58)
| ~ aElement0(X59)
| ~ aReductOfIn0(X58,X57,xR)
| ~ aReductOfIn0(X59,X57,xR) )
& ( sdtmndtplgtdt0(esk15_3(X57,X58,X59),xR,esk14_3(X57,X58,X59))
| aReductOfIn0(esk14_3(X57,X58,X59),X58,xR)
| X58 = esk14_3(X57,X58,X59)
| ~ aElement0(X57)
| ~ aElement0(X58)
| ~ aElement0(X59)
| ~ aReductOfIn0(X58,X57,xR)
| ~ aReductOfIn0(X59,X57,xR) )
& ( sdtmndtplgtdt0(X58,xR,esk14_3(X57,X58,X59))
| X58 = esk14_3(X57,X58,X59)
| ~ aElement0(X57)
| ~ aElement0(X58)
| ~ aElement0(X59)
| ~ aReductOfIn0(X58,X57,xR)
| ~ aReductOfIn0(X59,X57,xR) )
& ( sdtmndtasgtdt0(X58,xR,esk14_3(X57,X58,X59))
| ~ aElement0(X57)
| ~ aElement0(X58)
| ~ aElement0(X59)
| ~ aReductOfIn0(X58,X57,xR)
| ~ aReductOfIn0(X59,X57,xR) )
& ( aElement0(esk16_3(X57,X58,X59))
| aReductOfIn0(esk14_3(X57,X58,X59),X59,xR)
| X59 = esk14_3(X57,X58,X59)
| ~ aElement0(X57)
| ~ aElement0(X58)
| ~ aElement0(X59)
| ~ aReductOfIn0(X58,X57,xR)
| ~ aReductOfIn0(X59,X57,xR) )
& ( aReductOfIn0(esk16_3(X57,X58,X59),X59,xR)
| aReductOfIn0(esk14_3(X57,X58,X59),X59,xR)
| X59 = esk14_3(X57,X58,X59)
| ~ aElement0(X57)
| ~ aElement0(X58)
| ~ aElement0(X59)
| ~ aReductOfIn0(X58,X57,xR)
| ~ aReductOfIn0(X59,X57,xR) )
& ( sdtmndtplgtdt0(esk16_3(X57,X58,X59),xR,esk14_3(X57,X58,X59))
| aReductOfIn0(esk14_3(X57,X58,X59),X59,xR)
| X59 = esk14_3(X57,X58,X59)
| ~ aElement0(X57)
| ~ aElement0(X58)
| ~ aElement0(X59)
| ~ aReductOfIn0(X58,X57,xR)
| ~ aReductOfIn0(X59,X57,xR) )
& ( sdtmndtplgtdt0(X59,xR,esk14_3(X57,X58,X59))
| X59 = esk14_3(X57,X58,X59)
| ~ aElement0(X57)
| ~ aElement0(X58)
| ~ aElement0(X59)
| ~ aReductOfIn0(X58,X57,xR)
| ~ aReductOfIn0(X59,X57,xR) )
& ( sdtmndtasgtdt0(X59,xR,esk14_3(X57,X58,X59))
| ~ aElement0(X57)
| ~ aElement0(X58)
| ~ aElement0(X59)
| ~ aReductOfIn0(X58,X57,xR)
| ~ aReductOfIn0(X59,X57,xR) )
& isLocallyConfluent0(xR)
& ( ~ aReductOfIn0(X64,X63,xR)
| iLess0(X64,X63)
| ~ aElement0(X63)
| ~ aElement0(X64) )
& ( ~ aElement0(X65)
| ~ aReductOfIn0(X65,X63,xR)
| ~ sdtmndtplgtdt0(X65,xR,X64)
| iLess0(X64,X63)
| ~ aElement0(X63)
| ~ aElement0(X64) )
& ( ~ sdtmndtplgtdt0(X63,xR,X64)
| iLess0(X64,X63)
| ~ aElement0(X63)
| ~ aElement0(X64) )
& isTerminating0(xR) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__656_01])])])])]) ).
fof(c_0_9,hypothesis,
( aElement0(xw)
& ( aElement0(esk24_0)
| aReductOfIn0(xw,xu,xR)
| xu = xw )
& ( aReductOfIn0(esk24_0,xu,xR)
| aReductOfIn0(xw,xu,xR)
| xu = xw )
& ( sdtmndtplgtdt0(esk24_0,xR,xw)
| aReductOfIn0(xw,xu,xR)
| xu = xw )
& ( sdtmndtplgtdt0(xu,xR,xw)
| xu = xw )
& sdtmndtasgtdt0(xu,xR,xw)
& ( aElement0(esk25_0)
| aReductOfIn0(xw,xv,xR)
| xv = xw )
& ( aReductOfIn0(esk25_0,xv,xR)
| aReductOfIn0(xw,xv,xR)
| xv = xw )
& ( sdtmndtplgtdt0(esk25_0,xR,xw)
| aReductOfIn0(xw,xv,xR)
| xv = xw )
& ( sdtmndtplgtdt0(xv,xR,xw)
| xv = xw )
& sdtmndtasgtdt0(xv,xR,xw) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__799])])]) ).
cnf(c_0_10,negated_conjecture,
~ aNormalFormOfIn0(X1,xw,xR),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( aNormalFormOfIn0(esk13_2(X1,X2),X2,X1)
| ~ aRewritingSystem0(X1)
| ~ isTerminating0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
isTerminating0(xR),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
aRewritingSystem0(xR),
inference(split_conjunct,[status(thm)],[m__656]) ).
cnf(c_0_14,hypothesis,
aElement0(xw),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
$false,
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])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : COM018+4 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n018.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 05:08:09 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 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.XOtG6lPalP/E---3.1_2640.p
% 0.20/0.54 # Version: 3.1pre001
% 0.20/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2733 completed with status 0
% 0.20/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.54 # No SInE strategy applied
% 0.20/0.54 # Search class: FGHSF-FSLM32-SFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 811s (1) cores
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.54 # Starting U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 0.20/0.54 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 136s (1) cores
% 0.20/0.54 # G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with pid 2744 completed with status 0
% 0.20/0.54 # Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1
% 0.20/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.54 # No SInE strategy applied
% 0.20/0.54 # Search class: FGHSF-FSLM32-SFFFFFNN
% 0.20/0.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2m with 811s (1) cores
% 0.20/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.54 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.54 # Starting U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 0.20/0.54 # Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y1 with 136s (1) cores
% 0.20/0.54 # Preprocessing time : 0.004 s
% 0.20/0.54
% 0.20/0.54 # Proof found!
% 0.20/0.54 # SZS status Theorem
% 0.20/0.54 # SZS output start CNFRefutation
% See solution above
% 0.20/0.54 # Parsed axioms : 23
% 0.20/0.54 # Removed by relevancy pruning/SinE : 0
% 0.20/0.54 # Initial clauses : 377
% 0.20/0.54 # Removed in clause preprocessing : 4
% 0.20/0.54 # Initial clauses in saturation : 373
% 0.20/0.54 # Processed clauses : 46
% 0.20/0.54 # ...of these trivial : 0
% 0.20/0.54 # ...subsumed : 0
% 0.20/0.54 # ...remaining for further processing : 46
% 0.20/0.54 # Other redundant clauses eliminated : 0
% 0.20/0.54 # Clauses deleted for lack of memory : 0
% 0.20/0.54 # Backward-subsumed : 0
% 0.20/0.54 # Backward-rewritten : 0
% 0.20/0.54 # Generated clauses : 11
% 0.20/0.54 # ...of the previous two non-redundant : 5
% 0.20/0.54 # ...aggressively subsumed : 0
% 0.20/0.54 # Contextual simplify-reflections : 0
% 0.20/0.54 # Paramodulations : 11
% 0.20/0.54 # Factorizations : 0
% 0.20/0.54 # NegExts : 0
% 0.20/0.54 # Equation resolutions : 0
% 0.20/0.54 # Total rewrite steps : 10
% 0.20/0.54 # Propositional unsat checks : 0
% 0.20/0.54 # Propositional check models : 0
% 0.20/0.54 # Propositional check unsatisfiable : 0
% 0.20/0.54 # Propositional clauses : 0
% 0.20/0.54 # Propositional clauses after purity: 0
% 0.20/0.54 # Propositional unsat core size : 0
% 0.20/0.54 # Propositional preprocessing time : 0.000
% 0.20/0.54 # Propositional encoding time : 0.000
% 0.20/0.54 # Propositional solver time : 0.000
% 0.20/0.54 # Success case prop preproc time : 0.000
% 0.20/0.54 # Success case prop encoding time : 0.000
% 0.20/0.54 # Success case prop solver time : 0.000
% 0.20/0.54 # Current number of processed clauses : 46
% 0.20/0.54 # Positive orientable unit clauses : 17
% 0.20/0.54 # Positive unorientable unit clauses: 0
% 0.20/0.54 # Negative unit clauses : 1
% 0.20/0.54 # Non-unit-clauses : 28
% 0.20/0.54 # Current number of unprocessed clauses: 332
% 0.20/0.54 # ...number of literals in the above : 2790
% 0.20/0.54 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 0
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 131
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 114
% 0.20/0.54 # Non-unit clause-clause subsumptions : 0
% 0.20/0.54 # Unit Clause-clause subsumption calls : 0
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 3
% 0.20/0.54 # BW rewrite match successes : 0
% 0.20/0.54 # Condensation attempts : 46
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 20471
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.020 s
% 0.20/0.54 # System time : 0.004 s
% 0.20/0.54 # Total time : 0.024 s
% 0.20/0.54 # Maximum resident set size: 2572 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.047 s
% 0.20/0.54 # System time : 0.012 s
% 0.20/0.54 # Total time : 0.059 s
% 0.20/0.54 # Maximum resident set size: 1728 pages
% 0.20/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------