%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : BOO075-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:07:06 PM UTC 2026
% Result : Unsatisfiable 0.28s 0.53s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 4 RR)
% Number of literals : 17 ( 16 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sh_1,axiom,
nand(nand(X1,nand(nand(X2,X1),X1)),nand(X2,nand(X3,X1))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sh_1) ).
cnf(prove_meredith_2_basis_1,negated_conjecture,
nand(nand(a,a),nand(b,a)) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_meredith_2_basis_1) ).
cnf(c_0_2,axiom,
nand(nand(X1,nand(nand(X2,X1),X1)),nand(X2,nand(X3,X1))) = X2,
sh_1 ).
cnf(c_0_3,plain,
nand(nand(nand(X1,nand(X2,X3)),nand(nand(X4,nand(X1,nand(X2,X3))),nand(X1,nand(X2,X3)))),nand(X4,X1)) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
nand(nand(nand(X1,X2),nand(nand(X3,nand(X1,X2)),nand(X1,X2))),nand(X3,X1)) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
nand(nand(X1,nand(nand(X2,X1),X1)),nand(X2,nand(X3,nand(nand(X1,X3),X3)))) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_2]) ).
cnf(c_0_6,plain,
nand(nand(X1,nand(nand(nand(X2,nand(nand(X2,X2),X2)),X1),X1)),X2) = nand(X2,nand(nand(X2,X2),X2)),
inference(spm,[status(thm)],[c_0_5,c_0_2]) ).
cnf(c_0_7,plain,
nand(nand(X1,nand(nand(X2,X1),X1)),nand(X2,nand(nand(X2,X2),X2))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_2]),c_0_5]),c_0_5]) ).
cnf(c_0_8,plain,
nand(X1,nand(nand(X1,X1),X1)) = nand(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_5]) ).
cnf(c_0_9,plain,
nand(nand(nand(X1,X2),nand(nand(nand(X2,nand(nand(X3,X2),X2)),nand(X1,X2)),nand(X1,X2))),X3) = nand(X2,nand(nand(X3,X2),X2)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_10,plain,
nand(nand(X1,nand(nand(nand(X2,X2),X1),X1)),X2) = nand(X2,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_8]),c_0_8]) ).
cnf(c_0_11,plain,
nand(nand(X1,X1),nand(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_8]),c_0_8]) ).
cnf(c_0_12,negated_conjecture,
nand(nand(a,a),nand(b,a)) != a,
inference(fof_simplification,[status(thm)],[prove_meredith_2_basis_1]) ).
cnf(c_0_13,plain,
nand(X1,nand(nand(nand(nand(X2,X1),nand(X2,X1)),X1),X1)) = nand(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
nand(nand(a,a),nand(b,a)) != a,
c_0_12 ).
cnf(c_0_15,plain,
nand(nand(X1,X1),nand(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_13]),c_0_8]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO075-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n020.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 13:53:02 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.44 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.28/0.53 % Version: 3.5.1
% 0.28/0.53 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.28/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.53 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.28/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.53 % Starting sh5l with 300s (1) cores
% 0.28/0.53 % new_bool_1 with pid 3094515 completed with status 0
% 0.28/0.53 % Result found by new_bool_1
% 0.28/0.53 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.28/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.53 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.28/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.53 % Search class: FUUPF-FFSF22-MFFFFFNN
% 0.28/0.53 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.28/0.53 % SubtermCWHack with pid 3094522 completed with status 0
% 0.28/0.53 % Result found by SubtermCWHack
% 0.28/0.53 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.28/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.53 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.28/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.53 % Search class: FUUPF-FFSF22-MFFFFFNN
% 0.28/0.53 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.28/0.53 % Preprocessing time : 0.002 s
% 0.28/0.53
% 0.28/0.53 % Proof found!
% 0.28/0.53 % SZS status Unsatisfiable
% 0.28/0.53 % SZS output start CNFRefutation
% See solution above
% 0.28/0.53 % Parsed axioms : 2
% 0.28/0.53 % Removed by relevancy pruning/SinE : 0
% 0.28/0.53 % Initial clauses : 2
% 0.28/0.53 % Removed in clause preprocessing : 0
% 0.28/0.53 % Initial clauses in saturation : 2
% 0.28/0.53 % Processed clauses : 30
% 0.28/0.53 % ...of these trivial : 11
% 0.28/0.53 % ...subsumed : 0
% 0.28/0.53 % ...remaining for further processing : 19
% 0.28/0.53 % Other redundant clauses eliminated : 0
% 0.28/0.53 % Clauses deleted for lack of memory : 0
% 0.28/0.53 % Backward-subsumed : 0
% 0.28/0.53 % Backward-rewritten : 5
% 0.28/0.53 % Generated clauses : 529
% 0.28/0.53 % ...of the previous two non-redundant : 348
% 0.28/0.53 % ...aggressively subsumed : 0
% 0.28/0.53 % Contextual simplify-reflections : 0
% 0.28/0.53 % Paramodulations : 529
% 0.28/0.53 % Factorizations : 0
% 0.28/0.53 % NegExts : 0
% 0.28/0.53 % Equation resolutions : 0
% 0.28/0.53 % Disequality decompositions : 0
% 0.28/0.53 % Total rewrite steps : 334
% 0.28/0.53 % ...of those cached : 269
% 0.28/0.53 % Propositional unsat checks : 0
% 0.28/0.53 % Propositional check models : 0
% 0.28/0.53 % Propositional check unsatisfiable : 0
% 0.28/0.53 % Propositional clauses : 0
% 0.28/0.53 % Propositional clauses after purity: 0
% 0.28/0.53 % Propositional unsat core size : 0
% 0.28/0.53 % Propositional preprocessing time : 0.000
% 0.28/0.53 % Propositional encoding time : 0.000
% 0.28/0.53 % Propositional solver time : 0.000
% 0.28/0.53 % Success case prop preproc time : 0.000
% 0.28/0.53 % Success case prop encoding time : 0.000
% 0.28/0.53 % Success case prop solver time : 0.000
% 0.28/0.53 % Current number of processed clauses : 14
% 0.28/0.53 % Positive orientable unit clauses : 14
% 0.28/0.53 % Positive unorientable unit clauses: 0
% 0.28/0.53 % Negative unit clauses : 0
% 0.28/0.53 % Non-unit-clauses : 0
% 0.28/0.53 % Current number of unprocessed clauses: 313
% 0.28/0.53 % ...number of literals in the above : 313
% 0.28/0.53 % Current number of archived formulas : 0
% 0.28/0.53 % Current number of archived clauses : 5
% 0.28/0.53 % Clause-clause subsumption calls (NU) : 0
% 0.28/0.53 % Rec. Clause-clause subsumption calls : 0
% 0.28/0.53 % Non-unit clause-clause subsumptions : 0
% 0.28/0.53 % Unit Clause-clause subsumption calls : 0
% 0.28/0.53 % Rewrite failures with RHS unbound : 0
% 0.28/0.53 % BW rewrite match attempts : 76
% 0.28/0.53 % BW rewrite match successes : 4
% 0.28/0.53 % Condensation attempts : 0
% 0.28/0.53 % Condensation successes : 0
% 0.28/0.53 % Termbank termtop insertions : 9991
% 0.28/0.53 % Search garbage collected termcells : 2
% 0.28/0.53
% 0.28/0.53 % -------------------------------------------------
% 0.28/0.53 % User time : 0.014 s
% 0.28/0.53 % System time : 0.006 s
% 0.28/0.53 % Total time : 0.020 s
% 0.28/0.53 % Maximum resident set size: 3628 pages
% 0.28/0.53
% 0.28/0.53 % -------------------------------------------------
% 0.28/0.53 % User time : 0.016 s
% 0.28/0.53 % System time : 0.012 s
% 0.28/0.53 % Total time : 0.028 s
% 0.28/0.53 % Maximum resident set size: 4608 pages
% 0.28/0.53 % E exiting
%------------------------------------------------------------------------------