%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM128+1 : TPTP v9.3.1. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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.10s 0.45s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 68 ( 38 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 81 ( 35 ~; 27 |; 8 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 52 ( 2 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('fresh-unequal-var-3',conjecture,
! [X11,X12,X9,X24] :
( X24 = vgensym(vapp(vapp(X11,X12),vvar(X9)))
=> X9 != X24 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','fresh-unequal-var-3') ).
fof('gensym-is-fresh',axiom,
! [X14,X11] :
( vgensym(X11) = X14
=> ~ visFreeVar(X14,X11) ),
file('/export/starexec/sandbox/benchmark/Axioms/COM001+0.ax','gensym-is-fresh') ).
fof(isFreeVar2,axiom,
! [X1,X4,X12,X14,X13] :
( ( X4 = vapp(X12,X13)
& X1 = X14 )
=> ( ( visFreeVar(X1,X4)
=> ( visFreeVar(X14,X13)
| visFreeVar(X14,X12) ) )
& ( ( visFreeVar(X14,X13)
| visFreeVar(X14,X12) )
=> visFreeVar(X1,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/COM001+0.ax',isFreeVar2) ).
fof(isFreeVar0,axiom,
! [X1,X4,X9,X14] :
( ( X4 = vvar(X9)
& X1 = X14 )
=> ( ( visFreeVar(X1,X4)
=> X9 = X14 )
& ( X9 = X14
=> visFreeVar(X1,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/COM001+0.ax',isFreeVar0) ).
fof(c_0_4,negated_conjecture,
~ ! [X11,X12,X9,X24] :
( X24 = vgensym(vapp(vapp(X11,X12),vvar(X9)))
=> X9 != X24 ),
inference(assume_negation,[status(cth)],['fresh-unequal-var-3']) ).
fof(c_0_5,plain,
! [X14,X11] :
( vgensym(X11) = X14
=> ~ visFreeVar(X14,X11) ),
inference(fof_simplification,[status(thm)],['gensym-is-fresh']) ).
fof(c_0_6,negated_conjecture,
~ ! [X11,X12,X9,X24] :
( X24 = vgensym(vapp(vapp(X11,X12),vvar(X9)))
=> X9 != X24 ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_7,plain,
! [X40,X41] :
( ~ visFreeVar(X40,X41)
| vgensym(X41) != X40 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,negated_conjecture,
( esk3_0 = esk4_0
& esk4_0 = vgensym(vapp(vapp(esk1_0,esk2_0),vvar(esk3_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_9,plain,
( ~ visFreeVar(X2,X1)
| vgensym(X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
esk4_0 = vgensym(vapp(vapp(esk1_0,esk2_0),vvar(esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
esk3_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X73,X74,X75,X76,X77] :
( ( X74 != vapp(X75,X77)
| X73 != X76
| visFreeVar(X76,X77)
| visFreeVar(X76,X75)
| ~ visFreeVar(X73,X74) )
& ( X74 != vapp(X75,X77)
| X73 != X76
| visFreeVar(X73,X74)
| ~ visFreeVar(X76,X77) )
& ( X74 != vapp(X75,X77)
| X73 != X76
| visFreeVar(X73,X74)
| ~ visFreeVar(X76,X75) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[isFreeVar2])])])]) ).
fof(c_0_13,plain,
! [X84,X85,X86,X87] :
( ( X85 != vvar(X86)
| X84 != X87
| X86 = X87
| ~ visFreeVar(X84,X85) )
& ( X85 != vvar(X86)
| X84 != X87
| visFreeVar(X84,X85)
| X86 != X87 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[isFreeVar0])])])]) ).
cnf(c_0_14,plain,
~ visFreeVar(vgensym(X1),X1),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
vgensym(vapp(vapp(esk1_0,esk2_0),vvar(esk3_0))) = esk3_0,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( X4 != vapp(X5,X2)
| X3 != X1
| ~ visFreeVar(X1,X2)
| visFreeVar(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( X4 != vvar(X1)
| X3 != X2
| X1 != X2
| visFreeVar(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
~ visFreeVar(esk3_0,vapp(vapp(esk1_0,esk2_0),vvar(esk3_0))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( ~ visFreeVar(X1,X3)
| visFreeVar(X1,vapp(X2,X3)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_16])]) ).
cnf(c_0_20,plain,
visFreeVar(X1,vvar(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_17])])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM128+1 : TPTP v9.3.1. Released v6.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n005.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:17:17 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % new_bool_3 with pid 3707505 completed with status 0
% 0.10/0.45 % Result found by new_bool_3
% 0.10/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.45 % Search class: FGHSF-FSLF33-MFFFFFNN
% 0.10/0.45 % partial match(1): FGHSF-FSLF32-MFFFFFNN
% 0.10/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.45 % SubtermCWHack with pid 3707508 completed with status 0
% 0.10/0.45 % Result found by SubtermCWHack
% 0.10/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.45 % Search class: FGHSF-FSLF33-MFFFFFNN
% 0.10/0.45 % partial match(1): FGHSF-FSLF32-MFFFFFNN
% 0.10/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.45 % Preprocessing time : 0.004 s
% 0.10/0.45
% 0.10/0.45 % Proof found!
% 0.10/0.45 % SZS status Theorem
% 0.10/0.45 % SZS output start CNFRefutation
% See solution above
% 0.10/0.45 % Parsed axioms : 65
% 0.10/0.45 % Removed by relevancy pruning/SinE : 41
% 0.10/0.45 % Initial clauses : 209
% 0.10/0.45 % Removed in clause preprocessing : 4
% 0.10/0.45 % Initial clauses in saturation : 205
% 0.10/0.45 % Processed clauses : 23
% 0.10/0.45 % ...of these trivial : 0
% 0.10/0.45 % ...subsumed : 0
% 0.10/0.45 % ...remaining for further processing : 23
% 0.10/0.45 % Other redundant clauses eliminated : 8
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 0
% 0.10/0.45 % Backward-rewritten : 0
% 0.10/0.45 % Generated clauses : 16
% 0.10/0.45 % ...of the previous two non-redundant : 5
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 0
% 0.10/0.45 % Paramodulations : 3
% 0.10/0.45 % Factorizations : 0
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 17
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 2
% 0.10/0.45 % ...of those cached : 0
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 19
% 0.10/0.45 % Positive orientable unit clauses : 3
% 0.10/0.45 % Positive unorientable unit clauses: 0
% 0.10/0.45 % Negative unit clauses : 5
% 0.10/0.45 % Non-unit-clauses : 11
% 0.10/0.45 % Current number of unprocessed clauses: 187
% 0.10/0.45 % ...number of literals in the above : 870
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 0
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 52
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 45
% 0.10/0.45 % Non-unit clause-clause subsumptions : 0
% 0.10/0.45 % Unit Clause-clause subsumption calls : 1
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 0
% 0.10/0.45 % BW rewrite match successes : 0
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 11042
% 0.10/0.45 % Search garbage collected termcells : 2420
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.009 s
% 0.10/0.45 % System time : 0.003 s
% 0.10/0.45 % Total time : 0.012 s
% 0.10/0.45 % Maximum resident set size: 4272 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.014 s
% 0.10/0.45 % System time : 0.007 s
% 0.10/0.45 % Total time : 0.021 s
% 0.10/0.45 % Maximum resident set size: 4608 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------