%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MSC005-1 : TPTP v9.3.1. Released v1.0.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 01:28:26 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.57s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 11 unt; 0 nHn; 20 RR)
% Number of literals : 38 ( 0 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(evaluate_expression,negated_conjecture,
~ value(xor(xor(xor(xor(truth,falsity),falsity),truth),falsity),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',evaluate_expression) ).
cnf(false_xor_false,axiom,
( ~ value(X2,falsity)
| ~ value(X1,falsity)
| value(xor(X1,X2),falsity) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',false_xor_false) ).
cnf(false_is_false,axiom,
value(falsity,falsity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',false_is_false) ).
cnf(true_xor_true,axiom,
( ~ value(X2,truth)
| ~ value(X1,truth)
| value(xor(X1,X2),falsity) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',true_xor_true) ).
cnf(true_is_true,axiom,
value(truth,truth),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',true_is_true) ).
cnf(true_xor_false,axiom,
( ~ value(X2,falsity)
| ~ value(X1,truth)
| value(xor(X1,X2),truth) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',true_xor_false) ).
cnf(c_0_6,negated_conjecture,
~ value(xor(xor(xor(xor(truth,falsity),falsity),truth),falsity),X1),
inference(fof_simplification,[status(thm)],[evaluate_expression]) ).
cnf(c_0_7,plain,
( ~ value(X2,falsity)
| ~ value(X1,falsity)
| value(xor(X1,X2),falsity) ),
inference(fof_simplification,[status(thm)],[false_xor_false]) ).
cnf(c_0_8,negated_conjecture,
~ value(xor(xor(xor(xor(truth,falsity),falsity),truth),falsity),X1),
c_0_6 ).
cnf(c_0_9,plain,
( ~ value(X2,falsity)
| ~ value(X1,falsity)
| value(xor(X1,X2),falsity) ),
c_0_7 ).
cnf(c_0_10,axiom,
value(falsity,falsity),
false_is_false ).
cnf(c_0_11,plain,
( ~ value(X2,truth)
| ~ value(X1,truth)
| value(xor(X1,X2),falsity) ),
inference(fof_simplification,[status(thm)],[true_xor_true]) ).
cnf(c_0_12,negated_conjecture,
~ value(xor(xor(xor(truth,falsity),falsity),truth),falsity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_13,plain,
( ~ value(X2,truth)
| ~ value(X1,truth)
| value(xor(X1,X2),falsity) ),
c_0_11 ).
cnf(c_0_14,axiom,
value(truth,truth),
true_is_true ).
cnf(c_0_15,plain,
( ~ value(X2,falsity)
| ~ value(X1,truth)
| value(xor(X1,X2),truth) ),
inference(fof_simplification,[status(thm)],[true_xor_false]) ).
cnf(c_0_16,negated_conjecture,
~ value(xor(xor(truth,falsity),falsity),truth),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,plain,
( ~ value(X2,falsity)
| ~ value(X1,truth)
| value(xor(X1,X2),truth) ),
c_0_15 ).
cnf(c_0_18,negated_conjecture,
~ value(xor(truth,falsity),truth),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_10])]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_17]),c_0_10]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MSC005-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.51 % Computer : n007.cluster.edu
% 0.10/0.51 % Model : x86_64 x86_64
% 0.10/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.51 % Memory : 8046.5625MB
% 0.10/0.51 % OS : Linux 6.8.0-71-generic
% 0.10/0.51 % CPULimit : 300
% 0.10/0.51 % WCLimit : 300
% 0.10/0.51 % DateTime : Mon Sep 21 01:25:06 UTC 2026
% 0.10/0.52 % CPUTime :
% 0.10/0.52 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.56 Running first-order theorem proving
% 0.16/0.56 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.57 % Version: 3.5.1
% 0.16/0.57 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.57 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.57 % Starting sh5l with 300s (1) cores
% 0.16/0.57 % new_bool_3 with pid 4067051 completed with status 0
% 0.16/0.57 % Result found by new_bool_3
% 0.16/0.57 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.57 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.57 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.16/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.57 % SubtermCWHack with pid 4067056 completed with status 0
% 0.16/0.57 % Result found by SubtermCWHack
% 0.16/0.57 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.57 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.57 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.16/0.57 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.57 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.57 % Preprocessing time : 0.001 s
% 0.16/0.57
% 0.16/0.57 % Proof found!
% 0.16/0.57 % SZS status Unsatisfiable
% 0.16/0.57 % SZS output start CNFRefutation
% See solution above
% 0.16/0.57 % Parsed axioms : 7
% 0.16/0.57 % Removed by relevancy pruning/SinE : 0
% 0.16/0.57 % Initial clauses : 7
% 0.16/0.57 % Removed in clause preprocessing : 0
% 0.16/0.57 % Initial clauses in saturation : 7
% 0.16/0.57 % Processed clauses : 10
% 0.16/0.57 % ...of these trivial : 0
% 0.16/0.57 % ...subsumed : 0
% 0.16/0.57 % ...remaining for further processing : 10
% 0.16/0.57 % Other redundant clauses eliminated : 0
% 0.16/0.57 % Clauses deleted for lack of memory : 0
% 0.16/0.57 % Backward-subsumed : 0
% 0.16/0.57 % Backward-rewritten : 0
% 0.16/0.57 % Generated clauses : 10
% 0.16/0.57 % ...of the previous two non-redundant : 9
% 0.16/0.57 % ...aggressively subsumed : 0
% 0.16/0.57 % Contextual simplify-reflections : 0
% 0.16/0.57 % Paramodulations : 10
% 0.16/0.57 % Factorizations : 0
% 0.16/0.57 % NegExts : 0
% 0.16/0.57 % Equation resolutions : 0
% 0.16/0.57 % Disequality decompositions : 0
% 0.16/0.57 % Total rewrite steps : 6
% 0.16/0.57 % ...of those cached : 4
% 0.16/0.57 % Propositional unsat checks : 0
% 0.16/0.57 % Propositional check models : 0
% 0.16/0.57 % Propositional check unsatisfiable : 0
% 0.16/0.57 % Propositional clauses : 0
% 0.16/0.57 % Propositional clauses after purity: 0
% 0.16/0.57 % Propositional unsat core size : 0
% 0.16/0.57 % Propositional preprocessing time : 0.000
% 0.16/0.57 % Propositional encoding time : 0.000
% 0.16/0.57 % Propositional solver time : 0.000
% 0.16/0.57 % Success case prop preproc time : 0.000
% 0.16/0.57 % Success case prop encoding time : 0.000
% 0.16/0.57 % Success case prop solver time : 0.000
% 0.16/0.57 % Current number of processed clauses : 10
% 0.16/0.57 % Positive orientable unit clauses : 2
% 0.16/0.57 % Positive unorientable unit clauses: 0
% 0.16/0.57 % Negative unit clauses : 4
% 0.16/0.57 % Non-unit-clauses : 4
% 0.16/0.57 % Current number of unprocessed clauses: 5
% 0.16/0.57 % ...number of literals in the above : 9
% 0.16/0.57 % Current number of archived formulas : 0
% 0.16/0.57 % Current number of archived clauses : 0
% 0.16/0.57 % Clause-clause subsumption calls (NU) : 2
% 0.16/0.57 % Rec. Clause-clause subsumption calls : 2
% 0.16/0.57 % Non-unit clause-clause subsumptions : 0
% 0.16/0.57 % Unit Clause-clause subsumption calls : 6
% 0.16/0.57 % Rewrite failures with RHS unbound : 0
% 0.16/0.57 % BW rewrite match attempts : 0
% 0.16/0.57 % BW rewrite match successes : 0
% 0.16/0.57 % Condensation attempts : 0
% 0.16/0.57 % Condensation successes : 0
% 0.16/0.57 % Termbank termtop insertions : 310
% 0.16/0.57 % Search garbage collected termcells : 18
% 0.16/0.57
% 0.16/0.57 % -------------------------------------------------
% 0.16/0.57 % User time : 0.003 s
% 0.16/0.57 % System time : 0.002 s
% 0.16/0.57 % Total time : 0.004 s
% 0.16/0.57 % Maximum resident set size: 3584 pages
% 0.16/0.57
% 0.16/0.57 % -------------------------------------------------
% 0.16/0.57 % User time : 0.004 s
% 0.16/0.57 % System time : 0.004 s
% 0.16/0.57 % Total time : 0.007 s
% 0.16/0.57 % Maximum resident set size: 4864 pages
% 0.16/0.57 % E exiting
%------------------------------------------------------------------------------