%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG226+3 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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 11:55:41 AM UTC 2026
% Result : Theorem 62.73s 12.55s
% Output : CNFRefutation 62.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 79 ( 21 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 80 ( 26 ~; 16 |; 20 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t7_closure3,conjecture,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( ( m1_pboole(X2,X1)
& v2_relat_1(X2) )
=> ! [X3] :
( ( m1_pboole(X3,X1)
& v2_relat_1(X3) )
=> ( ( k7_relat_1(X2,k1_closure3(X1,X2)) = k7_relat_1(X3,k1_closure3(X1,X3))
& k1_closure3(X1,X2) = k1_closure3(X1,X3) )
=> r6_pboole(X1,X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_closure3) ).
fof(t6_closure3,axiom,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( ( m1_pboole(X2,X1)
& v2_relat_1(X2) )
=> X2 = k1_funct_4(k1_pboole(X1),k7_relat_1(X2,k1_closure3(X1,X2))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_closure3) ).
fof(redefinition_r6_pboole,axiom,
! [X1,X2,X3] :
( ( m1_pboole(X3,X1)
& m1_pboole(X2,X1) )
=> ( r6_pboole(X1,X2,X3)
<=> X2 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+80.ax',redefinition_r6_pboole) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( ( m1_pboole(X2,X1)
& v2_relat_1(X2) )
=> ! [X3] :
( ( m1_pboole(X3,X1)
& v2_relat_1(X3) )
=> ( ( k7_relat_1(X2,k1_closure3(X1,X2)) = k7_relat_1(X3,k1_closure3(X1,X3))
& k1_closure3(X1,X2) = k1_closure3(X1,X3) )
=> r6_pboole(X1,X2,X3) ) ) ) ),
inference(assume_negation,[status(cth)],[t7_closure3]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( ( m1_pboole(X2,X1)
& v2_relat_1(X2) )
=> ! [X3] :
( ( m1_pboole(X3,X1)
& v2_relat_1(X3) )
=> ( ( k7_relat_1(X2,k1_closure3(X1,X2)) = k7_relat_1(X3,k1_closure3(X1,X3))
& k1_closure3(X1,X2) = k1_closure3(X1,X3) )
=> r6_pboole(X1,X2,X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_5,plain,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( ( m1_pboole(X2,X1)
& v2_relat_1(X2) )
=> X2 = k1_funct_4(k1_pboole(X1),k7_relat_1(X2,k1_closure3(X1,X2))) ) ),
inference(fof_simplification,[status(thm)],[t6_closure3]) ).
fof(c_0_6,negated_conjecture,
( ~ r6_pboole(esk1_0,esk2_0,esk3_0)
& k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0)) = k7_relat_1(esk3_0,k1_closure3(esk1_0,esk3_0))
& k1_closure3(esk1_0,esk2_0) = k1_closure3(esk1_0,esk3_0)
& m1_pboole(esk3_0,esk1_0)
& v2_relat_1(esk3_0)
& m1_pboole(esk2_0,esk1_0)
& v2_relat_1(esk2_0)
& ~ v1_xboole_0(esk1_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,
! [X191,X192] :
( X192 = k1_funct_4(k1_pboole(X191),k7_relat_1(X192,k1_closure3(X191,X192)))
| ~ m1_pboole(X192,X191)
| ~ v2_relat_1(X192)
| v1_xboole_0(X191) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_8,negated_conjecture,
k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0)) = k7_relat_1(esk3_0,k1_closure3(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
k1_closure3(esk1_0,esk2_0) = k1_closure3(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ m1_pboole(X2,X1)
| ~ v2_relat_1(X2)
| X2 = k1_funct_4(k1_pboole(X1),k7_relat_1(X2,k1_closure3(X1,X2)))
| v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
k7_relat_1(esk3_0,k1_closure3(esk1_0,esk2_0)) = k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0)),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
m1_pboole(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
v2_relat_1(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
~ v1_xboole_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
k1_funct_4(k1_pboole(esk1_0),k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0))) = esk3_0,
inference(sr,[status(thm)],[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_9]),c_0_11]),c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_16,negated_conjecture,
m1_pboole(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
v2_relat_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_18,plain,
! [X27,X28,X29] :
( ( ~ m1_pboole(X29,X27)
| ~ m1_pboole(X28,X27)
| r6_pboole(X27,X28,X29)
| X28 != X29 )
& ( ~ m1_pboole(X29,X27)
| ~ m1_pboole(X28,X27)
| X28 = X29
| ~ r6_pboole(X27,X28,X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r6_pboole])])])]) ).
cnf(c_0_19,negated_conjecture,
~ r6_pboole(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
esk3_0 = esk2_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_16]),c_0_17])]),c_0_14]) ).
cnf(c_0_21,plain,
( ~ m1_pboole(X2,X3)
| ~ m1_pboole(X1,X3)
| X1 != X2
| r6_pboole(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
~ r6_pboole(esk1_0,esk2_0,esk2_0),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( ~ m1_pboole(X2,X1)
| r6_pboole(X1,X2,X2) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG226+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n001.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 13:12:16 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.54 Running first-order theorem proving
% 0.22/0.54 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
% 62.73/12.55 % Version: 3.5.1
% 62.73/12.55 % Preprocessing class: FMLLSMLLSSSNFFN.
% 62.73/12.55 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 62.73/12.55 % Starting new_bool_3 with 897s (3) cores
% 62.73/12.55 % Starting new_bool_1 with 897s (3) cores
% 62.73/12.55 % Starting sh5l with 299s (1) cores
% 62.73/12.55 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 62.73/12.55 % new_bool_3 with pid 3197526 completed with status 0
% 62.73/12.55 % Result found by new_bool_3
% 62.73/12.55 % Preprocessing class: FMLLSMLLSSSNFFN.
% 62.73/12.55 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 62.73/12.55 % Starting new_bool_3 with 897s (3) cores
% 62.73/12.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 62.73/12.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 62.73/12.55 % Search class: FGHSM-SMLM32-MFFFFFNN
% 62.73/12.55 % Scheduled 13 strats onto 3 cores with 897 seconds (897 total)
% 62.73/12.55 % Starting SubtermCWHack with 81s (1) cores
% 62.73/12.55 % Starting new_bool_3 with 90s (1) cores
% 62.73/12.55 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 62.73/12.55 % C12_02_nc_SAT001_MinMin_p005000_rr with pid 3197533 completed with status 0
% 62.73/12.55 % Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 62.73/12.55 % Preprocessing class: FMLLSMLLSSSNFFN.
% 62.73/12.55 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 62.73/12.55 % Starting new_bool_3 with 897s (3) cores
% 62.73/12.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 62.73/12.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 62.73/12.55 % Search class: FGHSM-SMLM32-MFFFFFNN
% 62.73/12.55 % Scheduled 13 strats onto 3 cores with 897 seconds (897 total)
% 62.73/12.55 % Starting SubtermCWHack with 81s (1) cores
% 62.73/12.55 % Starting new_bool_3 with 90s (1) cores
% 62.73/12.55 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 62.73/12.55 % Preprocessing time : 0.112 s
% 62.73/12.55 % Presaturation interreduction done
% 62.73/12.55
% 62.73/12.55 % Proof found!
% 62.73/12.55 % SZS status Theorem
% 62.73/12.55 % SZS output start CNFRefutation
% See solution above
% 62.73/12.55 % Parsed axioms : 16951
% 62.73/12.55 % Removed by relevancy pruning/SinE : 15614
% 62.73/12.55 % Initial clauses : 2593
% 62.73/12.55 % Removed in clause preprocessing : 45
% 62.73/12.55 % Initial clauses in saturation : 2548
% 62.73/12.55 % Processed clauses : 19538
% 62.73/12.55 % ...of these trivial : 213
% 62.73/12.55 % ...subsumed : 12399
% 62.73/12.55 % ...remaining for further processing : 6926
% 62.73/12.55 % Other redundant clauses eliminated : 645
% 62.73/12.55 % Clauses deleted for lack of memory : 0
% 62.73/12.55 % Backward-subsumed : 245
% 62.73/12.55 % Backward-rewritten : 366
% 62.73/12.55 % Generated clauses : 90003
% 62.73/12.55 % ...of the previous two non-redundant : 78167
% 62.73/12.55 % ...aggressively subsumed : 0
% 62.73/12.55 % Contextual simplify-reflections : 150
% 62.73/12.55 % Paramodulations : 89328
% 62.73/12.55 % Factorizations : 10
% 62.73/12.55 % NegExts : 0
% 62.73/12.55 % Equation resolutions : 667
% 62.73/12.55 % Disequality decompositions : 0
% 62.73/12.55 % Total rewrite steps : 42779
% 62.73/12.55 % ...of those cached : 39736
% 62.73/12.55 % Propositional unsat checks : 1
% 62.73/12.55 % Propositional check models : 1
% 62.73/12.55 % Propositional check unsatisfiable : 0
% 62.73/12.55 % Propositional clauses : 0
% 62.73/12.55 % Propositional clauses after purity: 0
% 62.73/12.55 % Propositional unsat core size : 0
% 62.73/12.55 % Propositional preprocessing time : 0.000
% 62.73/12.55 % Propositional encoding time : 0.065
% 62.73/12.55 % Propositional solver time : 0.064
% 62.73/12.55 % Success case prop preproc time : 0.000
% 62.73/12.55 % Success case prop encoding time : 0.000
% 62.73/12.55 % Success case prop solver time : 0.000
% 62.73/12.55 % Current number of processed clauses : 3765
% 62.73/12.55 % Positive orientable unit clauses : 524
% 62.73/12.55 % Positive unorientable unit clauses: 3
% 62.73/12.55 % Negative unit clauses : 717
% 62.73/12.55 % Non-unit-clauses : 2521
% 62.73/12.55 % Current number of unprocessed clauses: 62359
% 62.73/12.55 % ...number of literals in the above : 231058
% 62.73/12.55 % Current number of archived formulas : 0
% 62.73/12.55 % Current number of archived clauses : 2958
% 62.73/12.55 % Clause-clause subsumption calls (NU) : 6033750
% 62.73/12.55 % Rec. Clause-clause subsumption calls : 1871498
% 62.73/12.55 % Non-unit clause-clause subsumptions : 4512
% 62.73/12.55 % Unit Clause-clause subsumption calls : 362589
% 62.73/12.55 % Rewrite failures with RHS unbound : 12
% 62.73/12.55 % BW rewrite match attempts : 382
% 62.73/12.55 % BW rewrite match successes : 297
% 62.73/12.55 % Condensation attempts : 0
% 62.73/12.55 % Condensation successes : 0
% 62.73/12.55 % Termbank termtop insertions : 1812456
% 62.73/12.55 % Search garbage collected termcells : 189439
% 62.73/12.55
% 62.73/12.55 % -------------------------------------------------
% 62.73/12.55 % User time : 7.342 s
% 62.73/12.55 % System time : 0.235 s
% 62.73/12.55 % Total time : 7.577 s
% 62.73/12.55 % Maximum resident set size: 36600 pages
% 62.73/12.55
% 62.73/12.55 % -------------------------------------------------
% 62.73/12.55 % User time : 28.006 s
% 62.73/12.55 % System time : 0.831 s
% 62.73/12.55 % Total time : 28.837 s
% 62.73/12.55 % Maximum resident set size: 28672 pages
% 62.73/12.55 % E exiting
%------------------------------------------------------------------------------