%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM130+1 : TPTP v9.3.1. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:11:37 PM UTC 2026
% Result : Theorem 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 86 ( 42 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 99 ( 37 ~; 28 |; 21 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 94 ( 7 sgn 67 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('T-subst-abs-1',conjecture,
! [X15,X20,X9,X11,X21,X10,X12,X34] :
( ( vtcheck(vbind(X9,X15,X20),vabs(X21,X10,X12),X34)
& vtcheck(X20,X11,X15)
& X9 = X21 )
=> vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,X12)),X34) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','T-subst-abs-1') ).
fof('T-Strong',axiom,
! [X9,X10,X20,X11,X15] :
( ( vtcheck(vbind(X9,X10,X20),X11,X15)
& ~ visFreeVar(X9,X11) )
=> vtcheck(X20,X11,X15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','T-Strong') ).
fof(isFreeVar1,axiom,
! [X15,X1,X4,X9,X14,X11] :
( ( X4 = vabs(X9,X15,X11)
& X1 = X14 )
=> ( ( visFreeVar(X1,X4)
=> ( visFreeVar(X14,X11)
& X9 != X14 ) )
& ( ( visFreeVar(X14,X11)
& X9 != X14 )
=> visFreeVar(X1,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/COM001+0.ax',isFreeVar1) ).
fof(subst3,axiom,
! [X11,X9,X1,X4,X6,X19,X21,X15,X12] :
( ( X6 = vabs(X21,X15,X12)
& X4 = X11
& X1 = X9 )
=> ( X9 = X21
=> ( X19 = vsubst(X1,X4,X6)
=> X19 = vabs(X21,X15,X12) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/COM001+0.ax',subst3) ).
fof(c_0_4,negated_conjecture,
~ ! [X15,X20,X9,X11,X21,X10,X12,X34] :
( ( vtcheck(vbind(X9,X15,X20),vabs(X21,X10,X12),X34)
& vtcheck(X20,X11,X15)
& X9 = X21 )
=> vtcheck(X20,vsubst(X9,X11,vabs(X21,X10,X12)),X34) ),
inference(assume_negation,[status(cth)],['T-subst-abs-1']) ).
fof(c_0_5,plain,
! [X9,X10,X20,X11,X15] :
( ( vtcheck(vbind(X9,X10,X20),X11,X15)
& ~ visFreeVar(X9,X11) )
=> vtcheck(X20,X11,X15) ),
inference(fof_simplification,[status(thm)],['T-Strong']) ).
fof(c_0_6,negated_conjecture,
( ~ vtcheck(esk2_0,vsubst(esk3_0,esk4_0,vabs(esk5_0,esk6_0,esk7_0)),esk8_0)
& vtcheck(vbind(esk3_0,esk1_0,esk2_0),vabs(esk5_0,esk6_0,esk7_0),esk8_0)
& vtcheck(esk2_0,esk4_0,esk1_0)
& esk3_0 = esk5_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,plain,
! [X15,X1,X4,X9,X14,X11] :
( ( X4 = vabs(X9,X15,X11)
& X1 = X14 )
=> ( ( visFreeVar(X1,X4)
=> ( visFreeVar(X14,X11)
& X9 != X14 ) )
& ( ( visFreeVar(X14,X11)
& X9 != X14 )
=> visFreeVar(X1,X4) ) ) ),
inference(fof_simplification,[status(thm)],[isFreeVar1]) ).
fof(c_0_8,plain,
! [X57,X58,X59,X60,X61] :
( vtcheck(X59,X60,X61)
| ~ vtcheck(vbind(X57,X58,X59),X60,X61)
| visFreeVar(X57,X60) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,negated_conjecture,
vtcheck(vbind(esk3_0,esk1_0,esk2_0),vabs(esk5_0,esk6_0,esk7_0),esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
esk3_0 = esk5_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X132,X133,X134,X135,X136,X137] :
( ( X134 != vabs(X135,X132,X137)
| X133 != X136
| ~ visFreeVar(X133,X134)
| visFreeVar(X136,X137) )
& ( X134 != vabs(X135,X132,X137)
| X133 != X136
| ~ visFreeVar(X133,X134)
| X135 != X136 )
& ( X134 != vabs(X135,X132,X137)
| X133 != X136
| visFreeVar(X133,X134)
| ~ visFreeVar(X136,X137)
| X135 = X136 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_12,plain,
! [X89,X90,X91,X92,X93,X94,X95,X96,X97] :
( X94 = vabs(X95,X96,X97)
| X94 != vsubst(X91,X92,X93)
| X90 != X95
| X93 != vabs(X95,X96,X97)
| X92 != X89
| X91 != X90 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subst3])])]) ).
cnf(c_0_13,plain,
( ~ vtcheck(vbind(X1,X3,X4),X2,X5)
| vtcheck(X4,X2,X5)
| visFreeVar(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
vtcheck(vbind(esk3_0,esk1_0,esk2_0),vabs(esk3_0,esk6_0,esk7_0),esk8_0),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( X4 != vabs(X1,X5,X6)
| X3 != X2
| ~ visFreeVar(X3,X4)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
~ vtcheck(esk2_0,vsubst(esk3_0,esk4_0,vabs(esk5_0,esk6_0,esk7_0)),esk8_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
( X9 != vsubst(X1,X3,X5)
| X2 != X6
| X5 != vabs(X6,X7,X8)
| X3 != X4
| X1 != X2
| X9 = vabs(X6,X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( visFreeVar(esk3_0,vabs(esk3_0,esk6_0,esk7_0))
| vtcheck(esk2_0,vabs(esk3_0,esk6_0,esk7_0),esk8_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
~ visFreeVar(X1,vabs(X1,X2,X3)),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_15])])]) ).
cnf(c_0_20,negated_conjecture,
~ vtcheck(esk2_0,vsubst(esk3_0,esk4_0,vabs(esk3_0,esk6_0,esk7_0)),esk8_0),
inference(rw,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_21,plain,
vsubst(X1,X2,vabs(X1,X3,X4)) = vabs(X1,X3,X4),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_17])])])])]) ).
cnf(c_0_22,negated_conjecture,
vtcheck(esk2_0,vabs(esk3_0,esk6_0,esk7_0),esk8_0),
inference(sr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM130+1 : TPTP v9.3.1. Released v6.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.34 % Computer : n026.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Mon Sep 21 14:20:07 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.09/0.34 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % new_bool_3 with pid 2494154 completed with status 0
% 0.13/0.42 % Result found by new_bool_3
% 0.13/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FGHSF-FFMS32-SFFFFFNN
% 0.13/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42 % SubtermCWHack with pid 2494157 completed with status 0
% 0.13/0.42 % Result found by SubtermCWHack
% 0.13/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FGHSF-FFMS32-SFFFFFNN
% 0.13/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42 % Preprocessing time : 0.002 s
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Theorem
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 59
% 0.13/0.42 % Removed by relevancy pruning/SinE : 39
% 0.13/0.42 % Initial clauses : 37
% 0.13/0.42 % Removed in clause preprocessing : 4
% 0.13/0.42 % Initial clauses in saturation : 33
% 0.13/0.42 % Processed clauses : 56
% 0.13/0.42 % ...of these trivial : 0
% 0.13/0.42 % ...subsumed : 4
% 0.13/0.42 % ...remaining for further processing : 52
% 0.13/0.42 % Other redundant clauses eliminated : 33
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 0
% 0.13/0.42 % Backward-rewritten : 2
% 0.13/0.42 % Generated clauses : 51
% 0.13/0.42 % ...of the previous two non-redundant : 35
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 0
% 0.13/0.42 % Paramodulations : 29
% 0.13/0.42 % Factorizations : 0
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 42
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 8
% 0.13/0.42 % ...of those cached : 3
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 37
% 0.13/0.42 % Positive orientable unit clauses : 7
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 4
% 0.13/0.42 % Non-unit-clauses : 26
% 0.13/0.42 % Current number of unprocessed clauses: 12
% 0.13/0.42 % ...number of literals in the above : 60
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 3
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 147
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 106
% 0.13/0.42 % Non-unit clause-clause subsumptions : 4
% 0.13/0.42 % Unit Clause-clause subsumption calls : 0
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 5
% 0.13/0.42 % BW rewrite match successes : 2
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 4874
% 0.13/0.42 % Search garbage collected termcells : 1229
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.009 s
% 0.13/0.42 % System time : 0.003 s
% 0.13/0.42 % Total time : 0.011 s
% 0.13/0.42 % Maximum resident set size: 3752 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.013 s
% 0.13/0.42 % System time : 0.006 s
% 0.13/0.42 % Total time : 0.019 s
% 0.13/0.42 % Maximum resident set size: 4608 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------