%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM125+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 : n007.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:36 PM UTC 2026
% Result : Theorem 0.16s 0.52s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 7 unt; 0 def)
% Number of atoms : 87 ( 28 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 105 ( 42 ~; 27 |; 23 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 99 ( 7 sgn 72 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('T-Weak-FreeVar-abs',conjecture,
! [X9,X10,X20,X21,X35,X15] :
( ( vtcheck(X20,vabs(X21,X35,veabs),X15)
& ~ visFreeVar(X9,vabs(X21,X35,veabs)) )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','T-Weak-FreeVar-abs') ).
fof('T-Weak-FreeVar-abs-1',axiom,
! [X9,X10,X20,X21,X35,X15] :
( ( vtcheck(X20,vabs(X21,X35,veabs),X15)
& ~ visFreeVar(X9,vabs(X21,X35,veabs))
& X9 != X21 )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','T-Weak-FreeVar-abs-1') ).
fof('T-Weak-FreeVar-abs-2',axiom,
! [X9,X10,X20,X21,X35,X15] :
( ( vtcheck(X20,vabs(X21,X35,veabs),X15)
& ~ visFreeVar(X9,vabs(X21,X35,veabs))
& X9 = X21 )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','T-Weak-FreeVar-abs-2') ).
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(c_0_4,negated_conjecture,
~ ! [X9,X10,X20,X21,X35,X15] :
( ( vtcheck(X20,vabs(X21,X35,veabs),X15)
& ~ visFreeVar(X9,vabs(X21,X35,veabs)) )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
inference(assume_negation,[status(cth)],['T-Weak-FreeVar-abs']) ).
fof(c_0_5,negated_conjecture,
~ ! [X9,X10,X20,X21,X35,X15] :
( ( vtcheck(X20,vabs(X21,X35,veabs),X15)
& ~ visFreeVar(X9,vabs(X21,X35,veabs)) )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X9,X10,X20,X21,X35,X15] :
( ( vtcheck(X20,vabs(X21,X35,veabs),X15)
& ~ visFreeVar(X9,vabs(X21,X35,veabs))
& X9 != X21 )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
inference(fof_simplification,[status(thm)],['T-Weak-FreeVar-abs-1']) ).
fof(c_0_7,negated_conjecture,
( ~ vtcheck(vbind(esk1_0,esk2_0,esk3_0),vabs(esk4_0,esk5_0,veabs),esk6_0)
& vtcheck(esk3_0,vabs(esk4_0,esk5_0,veabs),esk6_0)
& ~ visFreeVar(esk1_0,vabs(esk4_0,esk5_0,veabs)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,plain,
! [X76,X77,X78,X79,X80,X81] :
( vtcheck(vbind(X76,X77,X78),vabs(X79,X80,veabs),X81)
| ~ vtcheck(X78,vabs(X79,X80,veabs),X81)
| visFreeVar(X76,vabs(X79,X80,veabs))
| X76 = X79 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
! [X9,X10,X20,X21,X35,X15] :
( ( vtcheck(X20,vabs(X21,X35,veabs),X15)
& ~ visFreeVar(X9,vabs(X21,X35,veabs))
& X9 = X21 )
=> vtcheck(vbind(X9,X10,X20),vabs(X21,X35,veabs),X15) ),
inference(fof_simplification,[status(thm)],['T-Weak-FreeVar-abs-2']) ).
fof(c_0_10,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]) ).
cnf(c_0_11,negated_conjecture,
~ vtcheck(vbind(esk1_0,esk2_0,esk3_0),vabs(esk4_0,esk5_0,veabs),esk6_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ vtcheck(X4,vabs(X2,X3,veabs),X5)
| vtcheck(vbind(X1,X6,X4),vabs(X2,X3,veabs),X5)
| visFreeVar(X1,vabs(X2,X3,veabs))
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
vtcheck(esk3_0,vabs(esk4_0,esk5_0,veabs),esk6_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
~ visFreeVar(esk1_0,vabs(esk4_0,esk5_0,veabs)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_15,plain,
! [X82,X83,X84,X85,X86,X87] :
( vtcheck(vbind(X82,X83,X84),vabs(X85,X86,veabs),X87)
| ~ vtcheck(X84,vabs(X85,X86,veabs),X87)
| visFreeVar(X82,vabs(X85,X86,veabs))
| X82 != X85 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_16,plain,
! [X98,X99,X100,X101,X102,X103] :
( ( X100 != vabs(X101,X98,X103)
| X99 != X102
| ~ visFreeVar(X99,X100)
| visFreeVar(X102,X103) )
& ( X100 != vabs(X101,X98,X103)
| X99 != X102
| ~ visFreeVar(X99,X100)
| X101 != X102 )
& ( X100 != vabs(X101,X98,X103)
| X99 != X102
| visFreeVar(X99,X100)
| ~ visFreeVar(X102,X103)
| X101 = X102 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
cnf(c_0_17,negated_conjecture,
esk1_0 = esk4_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_18,plain,
( ~ vtcheck(X4,vabs(X2,X3,veabs),X5)
| X1 != X2
| vtcheck(vbind(X1,X6,X4),vabs(X2,X3,veabs),X5)
| visFreeVar(X1,vabs(X2,X3,veabs)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( X4 != vabs(X1,X5,X6)
| X3 != X2
| ~ visFreeVar(X3,X4)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ vtcheck(vbind(esk4_0,esk2_0,esk3_0),vabs(esk4_0,esk5_0,veabs),esk6_0),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_21,plain,
( ~ vtcheck(X3,vabs(X4,X5,veabs),X6)
| visFreeVar(X1,vabs(X4,X5,veabs))
| vtcheck(vbind(X1,X2,X3),vabs(X4,X5,veabs),X6) ),
inference(csr,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_22,plain,
~ visFreeVar(X1,vabs(X1,X2,X3)),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_19])])]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_13])]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM125+1 : TPTP v9.3.1. Released v6.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 14:15:20 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.16/0.52 % Version: 3.5.1
% 0.16/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.52 % Starting sh5l with 300s (1) cores
% 0.16/0.52 % new_bool_3 with pid 1309518 completed with status 0
% 0.16/0.52 % Result found by new_bool_3
% 0.16/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.52 % Search class: FGHSF-FSLF32-MFFFFFNN
% 0.16/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.52 % SubtermCWHack with pid 1309521 completed with status 0
% 0.16/0.52 % Result found by SubtermCWHack
% 0.16/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.52 % Search class: FGHSF-FSLF32-MFFFFFNN
% 0.16/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.52 % Preprocessing time : 0.002 s
% 0.16/0.52
% 0.16/0.52 % Proof found!
% 0.16/0.52 % SZS status Theorem
% 0.16/0.52 % SZS output start CNFRefutation
% See solution above
% 0.16/0.52 % Parsed axioms : 60
% 0.16/0.52 % Removed by relevancy pruning/SinE : 25
% 0.16/0.52 % Initial clauses : 161
% 0.16/0.52 % Removed in clause preprocessing : 5
% 0.16/0.52 % Initial clauses in saturation : 156
% 0.16/0.52 % Processed clauses : 814
% 0.16/0.52 % ...of these trivial : 18
% 0.16/0.52 % ...subsumed : 412
% 0.16/0.52 % ...remaining for further processing : 384
% 0.16/0.52 % Other redundant clauses eliminated : 439
% 0.16/0.52 % Clauses deleted for lack of memory : 0
% 0.16/0.52 % Backward-subsumed : 27
% 0.16/0.52 % Backward-rewritten : 6
% 0.16/0.52 % Generated clauses : 5357
% 0.16/0.52 % ...of the previous two non-redundant : 4719
% 0.16/0.52 % ...aggressively subsumed : 0
% 0.16/0.52 % Contextual simplify-reflections : 2
% 0.16/0.52 % Paramodulations : 4941
% 0.16/0.52 % Factorizations : 0
% 0.16/0.52 % NegExts : 0
% 0.16/0.52 % Equation resolutions : 449
% 0.16/0.52 % Disequality decompositions : 0
% 0.16/0.52 % Total rewrite steps : 714
% 0.16/0.52 % ...of those cached : 613
% 0.16/0.52 % Propositional unsat checks : 0
% 0.16/0.52 % Propositional check models : 0
% 0.16/0.52 % Propositional check unsatisfiable : 0
% 0.16/0.52 % Propositional clauses : 0
% 0.16/0.52 % Propositional clauses after purity: 0
% 0.16/0.52 % Propositional unsat core size : 0
% 0.16/0.52 % Propositional preprocessing time : 0.000
% 0.16/0.52 % Propositional encoding time : 0.000
% 0.16/0.52 % Propositional solver time : 0.000
% 0.16/0.52 % Success case prop preproc time : 0.000
% 0.16/0.52 % Success case prop encoding time : 0.000
% 0.16/0.52 % Success case prop solver time : 0.000
% 0.16/0.52 % Current number of processed clauses : 323
% 0.16/0.52 % Positive orientable unit clauses : 25
% 0.16/0.52 % Positive unorientable unit clauses: 5
% 0.16/0.52 % Negative unit clauses : 21
% 0.16/0.52 % Non-unit-clauses : 272
% 0.16/0.52 % Current number of unprocessed clauses: 4053
% 0.16/0.52 % ...number of literals in the above : 19793
% 0.16/0.52 % Current number of archived formulas : 0
% 0.16/0.52 % Current number of archived clauses : 33
% 0.16/0.52 % Clause-clause subsumption calls (NU) : 12067
% 0.16/0.52 % Rec. Clause-clause subsumption calls : 5193
% 0.16/0.52 % Non-unit clause-clause subsumptions : 274
% 0.16/0.52 % Unit Clause-clause subsumption calls : 835
% 0.16/0.52 % Rewrite failures with RHS unbound : 72
% 0.16/0.52 % BW rewrite match attempts : 325
% 0.16/0.52 % BW rewrite match successes : 9
% 0.16/0.52 % Condensation attempts : 0
% 0.16/0.52 % Condensation successes : 0
% 0.16/0.52 % Termbank termtop insertions : 97101
% 0.16/0.52 % Search garbage collected termcells : 2282
% 0.16/0.52
% 0.16/0.52 % -------------------------------------------------
% 0.16/0.52 % User time : 0.069 s
% 0.16/0.52 % System time : 0.011 s
% 0.16/0.52 % Total time : 0.080 s
% 0.16/0.52 % Maximum resident set size: 4008 pages
% 0.16/0.52
% 0.16/0.52 % -------------------------------------------------
% 0.16/0.52 % User time : 0.071 s
% 0.16/0.52 % System time : 0.017 s
% 0.16/0.52 % Total time : 0.088 s
% 0.16/0.52 % Maximum resident set size: 4864 pages
% 0.16/0.52 % E exiting
%------------------------------------------------------------------------------