%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT045-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:01 PM UTC 2026
% Result : Unsatisfiable 0.16s 5.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 9 unt; 0 nHn; 15 RR)
% Number of literals : 27 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(assumption_8_32,axiom,
( ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1)
| greater(external_ties(X1,X2),external_ties(X1,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_8_32) ).
cnf(assumption_6_30,axiom,
( ~ greater(external_ties(X1,X2),external_ties(X1,X3))
| ~ organization(X1)
| greater(position(X1,X2),position(X1,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_6_30) ).
cnf(lemma_4_34,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_4_34) ).
cnf(lemma_4_33,negated_conjecture,
organization(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_4_33) ).
cnf(lemma_4_35,negated_conjecture,
~ greater(position(sk1,sk3),position(sk1,sk2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_4_35) ).
cnf(c_0_5,plain,
( ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1)
| greater(external_ties(X1,X2),external_ties(X1,X3)) ),
inference(fof_simplification,[status(thm)],[assumption_8_32]) ).
cnf(c_0_6,plain,
( ~ greater(external_ties(X1,X2),external_ties(X1,X3))
| ~ organization(X1)
| greater(position(X1,X2),position(X1,X3)) ),
inference(fof_simplification,[status(thm)],[assumption_6_30]) ).
cnf(c_0_7,plain,
( ~ greater(age(X1,X2),age(X1,X3))
| ~ organization(X1)
| greater(external_ties(X1,X2),external_ties(X1,X3)) ),
c_0_5 ).
cnf(c_0_8,negated_conjecture,
greater(age(sk1,sk3),age(sk1,sk2)),
lemma_4_34 ).
cnf(c_0_9,negated_conjecture,
organization(sk1),
lemma_4_33 ).
cnf(c_0_10,negated_conjecture,
~ greater(position(sk1,sk3),position(sk1,sk2)),
inference(fof_simplification,[status(thm)],[lemma_4_35]) ).
cnf(c_0_11,plain,
( ~ greater(external_ties(X1,X2),external_ties(X1,X3))
| ~ organization(X1)
| greater(position(X1,X2),position(X1,X3)) ),
c_0_6 ).
cnf(c_0_12,negated_conjecture,
greater(external_ties(sk1,sk3),external_ties(sk1,sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_13,negated_conjecture,
~ greater(position(sk1,sk3),position(sk1,sk2)),
c_0_10 ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_9])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT045-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.38 % Computer : n016.cluster.edu
% 0.13/5.38 % Model : x86_64 x86_64
% 0.13/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.38 % Memory : 8046.5625MB
% 0.13/5.38 % OS : Linux 6.8.0-71-generic
% 0.13/5.38 % CPULimit : 300
% 0.13/5.38 % WCLimit : 300
% 0.13/5.38 % DateTime : Mon Sep 21 01:28:29 UTC 2026
% 0.13/5.38 % CPUTime :
% 0.13/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.43 Running first-order theorem proving
% 0.16/5.43 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.16/5.45 % Version: 3.5.1
% 0.16/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.45 % Starting sh5l with 300s (1) cores
% 0.16/5.45 % new_bool_3 with pid 1275942 completed with status 0
% 0.16/5.45 % Result found by new_bool_3
% 0.16/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.45 % Search class: FHHSF-FFSF22-SFFFFFNN
% 0.16/5.45 % partial match(1): FGHSF-FFSF22-SFFFFFNN
% 0.16/5.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.45 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.45 % SubtermCWHack with pid 1275948 completed with status 0
% 0.16/5.45 % Result found by SubtermCWHack
% 0.16/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.45 % Search class: FHHSF-FFSF22-SFFFFFNN
% 0.16/5.45 % partial match(1): FGHSF-FFSF22-SFFFFFNN
% 0.16/5.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.45 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.45 % Preprocessing time : 0.001 s
% 0.16/5.45
% 0.16/5.45 % Proof found!
% 0.16/5.45 % SZS status Unsatisfiable
% 0.16/5.45 % SZS output start CNFRefutation
% See solution above
% 0.16/5.45 % Parsed axioms : 17
% 0.16/5.45 % Removed by relevancy pruning/SinE : 9
% 0.16/5.45 % Initial clauses : 8
% 0.16/5.45 % Removed in clause preprocessing : 0
% 0.16/5.45 % Initial clauses in saturation : 8
% 0.16/5.45 % Processed clauses : 22
% 0.16/5.45 % ...of these trivial : 0
% 0.16/5.45 % ...subsumed : 2
% 0.16/5.45 % ...remaining for further processing : 20
% 0.16/5.45 % Other redundant clauses eliminated : 0
% 0.16/5.45 % Clauses deleted for lack of memory : 0
% 0.16/5.45 % Backward-subsumed : 0
% 0.16/5.45 % Backward-rewritten : 0
% 0.16/5.45 % Generated clauses : 18
% 0.16/5.45 % ...of the previous two non-redundant : 16
% 0.16/5.45 % ...aggressively subsumed : 0
% 0.16/5.45 % Contextual simplify-reflections : 0
% 0.16/5.45 % Paramodulations : 17
% 0.16/5.45 % Factorizations : 0
% 0.16/5.45 % NegExts : 0
% 0.16/5.45 % Equation resolutions : 1
% 0.16/5.45 % Disequality decompositions : 0
% 0.16/5.45 % Total rewrite steps : 4
% 0.16/5.45 % ...of those cached : 3
% 0.16/5.45 % Propositional unsat checks : 0
% 0.16/5.45 % Propositional check models : 0
% 0.16/5.45 % Propositional check unsatisfiable : 0
% 0.16/5.45 % Propositional clauses : 0
% 0.16/5.45 % Propositional clauses after purity: 0
% 0.16/5.45 % Propositional unsat core size : 0
% 0.16/5.45 % Propositional preprocessing time : 0.000
% 0.16/5.45 % Propositional encoding time : 0.000
% 0.16/5.45 % Propositional solver time : 0.000
% 0.16/5.45 % Success case prop preproc time : 0.000
% 0.16/5.45 % Success case prop encoding time : 0.000
% 0.16/5.45 % Success case prop solver time : 0.000
% 0.16/5.45 % Current number of processed clauses : 20
% 0.16/5.45 % Positive orientable unit clauses : 3
% 0.16/5.45 % Positive unorientable unit clauses: 0
% 0.16/5.45 % Negative unit clauses : 3
% 0.16/5.45 % Non-unit-clauses : 14
% 0.16/5.45 % Current number of unprocessed clauses: 1
% 0.16/5.45 % ...number of literals in the above : 2
% 0.16/5.45 % Current number of archived formulas : 0
% 0.16/5.45 % Current number of archived clauses : 0
% 0.16/5.45 % Clause-clause subsumption calls (NU) : 35
% 0.16/5.45 % Rec. Clause-clause subsumption calls : 33
% 0.16/5.45 % Non-unit clause-clause subsumptions : 0
% 0.16/5.45 % Unit Clause-clause subsumption calls : 0
% 0.16/5.45 % Rewrite failures with RHS unbound : 0
% 0.16/5.45 % BW rewrite match attempts : 0
% 0.16/5.45 % BW rewrite match successes : 0
% 0.16/5.45 % Condensation attempts : 0
% 0.16/5.45 % Condensation successes : 0
% 0.16/5.45 % Termbank termtop insertions : 616
% 0.16/5.45 % Search garbage collected termcells : 48
% 0.16/5.45
% 0.16/5.45 % -------------------------------------------------
% 0.16/5.45 % User time : 0.003 s
% 0.16/5.45 % System time : 0.002 s
% 0.16/5.45 % Total time : 0.006 s
% 0.16/5.45 % Maximum resident set size: 3640 pages
% 0.16/5.45
% 0.16/5.45 % -------------------------------------------------
% 0.16/5.45 % User time : 0.003 s
% 0.16/5.45 % System time : 0.008 s
% 0.16/5.45 % Total time : 0.012 s
% 0.16/5.45 % Maximum resident set size: 4864 pages
% 0.16/5.45 % E exiting
%------------------------------------------------------------------------------