↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEU615_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n011.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 02:26:16 PM UTC 2026

% Result   : Theorem 0.09s 0.41s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU615_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35  % Computer : n011.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 06:45:26 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.40  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.09/0.41  % Version: 3.5.1
% 0.09/0.41  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.09/0.41  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.41  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.09/0.41  % Starting new_bool_3 with 300s (1) cores
% 0.09/0.41  % Starting new_bool_1 with 300s (1) cores
% 0.09/0.41  % Starting sh5l with 300s (1) cores
% 0.09/0.41  % sh5l with pid 1249907 completed with status 0
% 0.09/0.41  % Result found by sh5l
% 0.09/0.41  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.09/0.41  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.41  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.09/0.41  % Starting new_bool_3 with 300s (1) cores
% 0.09/0.41  % Starting new_bool_1 with 300s (1) cores
% 0.09/0.41  % Starting sh5l with 300s (1) cores
% 0.09/0.41  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.09/0.41  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.09/0.41  % Search class: FGHNF-FFSS22-SFFFFFNN
% 0.09/0.41  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.41  % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.41  % SubtermCWHack with pid 1249913 completed with status 0
% 0.09/0.41  % Result found by SubtermCWHack
% 0.09/0.41  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.09/0.41  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.41  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.09/0.41  % Starting new_bool_3 with 300s (1) cores
% 0.09/0.41  % Starting new_bool_1 with 300s (1) cores
% 0.09/0.41  % Starting sh5l with 300s (1) cores
% 0.09/0.41  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.09/0.41  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.09/0.41  % Search class: FGHNF-FFSS22-SFFFFFNN
% 0.09/0.41  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.41  % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.41  % Preprocessing time       : 0.001 s
% 0.09/0.41  
% 0.09/0.41  % Proof found!
% 0.09/0.41  % SZS status Theorem
% 0.09/0.41  % SZS output start CNFRefutation
% 0.09/0.41  tff(decl_23, type, in: ($i * $i) > $o).
% 0.09/0.41  tff(decl_24, type, symdiff: ($i * $i) > $i).
% 0.09/0.41  tff(decl_25, type, symdiffE: $o).
% 0.09/0.41  tff(decl_26, type, esk1_0: $i).
% 0.09/0.41  tff(decl_27, type, esk2_0: $i).
% 0.09/0.41  tff(decl_28, type, esk3_0: $i).
% 0.09/0.41  tff(decl_29, type, esk4_0: $i).
% 0.09/0.41  tff(decl_30, type, esk5_0: $i).
% 0.09/0.41  tff(decl_31, type, esk6_0: $i).
% 0.09/0.41  tff(decl_32, type, epred1_0: $o).
% 0.09/0.41  fof(symdiffIneg2, conjecture, (symdiffE=>![X1, X2, X3]:((~(in(X3,X1))=>(~(in(X3,X2))=>~(in(X3,symdiff(X1,X2))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', symdiffIneg2)).
% 0.09/0.41  fof(symdiffE, axiom, (symdiffE<=>![X1, X2, X3]:((in(X3,symdiff(X1,X2))=>![X4:$o]:(((in(X3,X1)=>(~(in(X3,X2))=>X4))=>((~(in(X3,X1))=>(in(X3,X2)=>X4))=>X4)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', symdiffE)).
% 0.09/0.41  fof(c_0_2, negated_conjecture, ~((symdiffE=>![X1, X2, X3]:((~(in(X3,X1))=>(~(in(X3,X2))=>~(in(X3,symdiff(X1,X2)))))))), inference(assume_negation,[status(cth)],[symdiffIneg2])).
% 0.09/0.41  fof(c_0_3, plain, (symdiffE<=>![X1, X2, X3]:((in(X3,symdiff(X1,X2))=>![X4:$o]:(((in(X3,X1)=>(~in(X3,X2)=>X4))=>((~in(X3,X1)=>(in(X3,X2)=>X4))=>X4)))))), inference(fof_simplification,[status(thm)],[symdiffE])).
% 0.09/0.41  fof(c_0_4, negated_conjecture, ~((symdiffE=>![X1, X2, X3]:((~in(X3,X1)=>(~in(X3,X2)=>~in(X3,symdiff(X1,X2))))))), inference(fof_simplification,[status(thm)],[c_0_2])).
% 0.09/0.41  fof(c_0_5, plain, ![X8, X9, X10, X11:$o]:(((((~in(X10,X8)|X11|in(X10,X8)|~in(X10,symdiff(X8,X9))|~symdiffE)&((in(X10,X9)|X11|in(X10,X8)|~in(X10,symdiff(X8,X9))|~symdiffE)&(~X11|X11|in(X10,X8)|~in(X10,symdiff(X8,X9))|~symdiffE)))&(((~in(X10,X8)|X11|~in(X10,X9)|~in(X10,symdiff(X8,X9))|~symdiffE)&((in(X10,X9)|X11|~in(X10,X9)|~in(X10,symdiff(X8,X9))|~symdiffE)&(~X11|X11|~in(X10,X9)|~in(X10,symdiff(X8,X9))|~symdiffE)))&((~in(X10,X8)|X11|~X11|~in(X10,symdiff(X8,X9))|~symdiffE)&((in(X10,X9)|X11|~X11|~in(X10,symdiff(X8,X9))|~symdiffE)&(~X11|X11|~X11|~in(X10,symdiff(X8,X9))|~symdiffE)))))&((in(esk6_0,symdiff(esk4_0,esk5_0))|symdiffE)&((~in(esk6_0,esk4_0)|(in(esk6_0,esk5_0)|epred1_0)|symdiffE)&((in(esk6_0,esk4_0)|(~in(esk6_0,esk5_0)|epred1_0)|symdiffE)&(~epred1_0|symdiffE)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])])).
% 0.09/0.41  fof(c_0_6, negated_conjecture, (symdiffE&(~in(esk3_0,esk1_0)&(~in(esk3_0,esk2_0)&in(esk3_0,symdiff(esk1_0,esk2_0))))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])).
% 0.09/0.41  cnf(c_0_7, plain, (in(X1,X2)|in(X1,X3)|~in(X1,symdiff(X3,X2))|~symdiffE), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_5])])])).
% 0.09/0.41  cnf(c_0_8, negated_conjecture, (symdiffE), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.09/0.41  cnf(c_0_9, plain, (in(X1,X2)|in(X1,X3)|~in(X1,symdiff(X3,X2))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8])])).
% 0.09/0.41  cnf(c_0_10, negated_conjecture, (in(esk3_0,symdiff(esk1_0,esk2_0))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.09/0.41  cnf(c_0_11, negated_conjecture, (~in(esk3_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.09/0.41  cnf(c_0_12, negated_conjecture, (~in(esk3_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.09/0.41  cnf(c_0_13, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11]), c_0_12]), ['proof']).
% 0.09/0.41  % SZS output end CNFRefutation
% 0.09/0.41  % Parsed axioms                        : 5
% 0.09/0.41  % Removed by relevancy pruning/SinE    : 3
% 0.09/0.41  % Initial clauses                      : 17
% 0.09/0.41  % Removed in clause preprocessing      : 7
% 0.09/0.41  % Initial clauses in saturation        : 10
% 0.09/0.41  % Processed clauses                    : 9
% 0.09/0.41  % ...of these trivial                  : 4
% 0.09/0.41  % ...subsumed                          : 0
% 0.09/0.41  % ...remaining for further processing  : 5
% 0.09/0.41  % Other redundant clauses eliminated   : 0
% 0.09/0.41  % Clauses deleted for lack of memory   : 0
% 0.09/0.41  % Backward-subsumed                    : 0
% 0.09/0.41  % Backward-rewritten                   : 0
% 0.09/0.41  % Generated clauses                    : 1
% 0.09/0.41  % ...of the previous two non-redundant : 0
% 0.09/0.41  % ...aggressively subsumed             : 0
% 0.09/0.41  % Contextual simplify-reflections      : 0
% 0.09/0.41  % Paramodulations                      : 1
% 0.09/0.41  % Factorizations                       : 0
% 0.09/0.41  % NegExts                              : 0
% 0.09/0.41  % Equation resolutions                 : 0
% 0.09/0.41  % Disequality decompositions           : 0
% 0.09/0.41  % Total rewrite steps                  : 5
% 0.09/0.41  % ...of those cached                   : 4
% 0.09/0.41  % Propositional unsat checks           : 0
% 0.09/0.41  %    Propositional check models        : 0
% 0.09/0.41  %    Propositional check unsatisfiable : 0
% 0.09/0.41  %    Propositional clauses             : 0
% 0.09/0.41  %    Propositional clauses after purity: 0
% 0.09/0.41  %    Propositional unsat core size     : 0
% 0.09/0.41  %    Propositional preprocessing time  : 0.000
% 0.09/0.41  %    Propositional encoding time       : 0.000
% 0.09/0.41  %    Propositional solver time         : 0.000
% 0.09/0.41  %    Success case prop preproc time    : 0.000
% 0.09/0.41  %    Success case prop encoding time   : 0.000
% 0.09/0.41  %    Success case prop solver time     : 0.000
% 0.09/0.41  % Current number of processed clauses  : 5
% 0.09/0.41  %    Positive orientable unit clauses  : 2
% 0.09/0.41  %    Positive unorientable unit clauses: 0
% 0.09/0.41  %    Negative unit clauses             : 2
% 0.09/0.41  %    Non-unit-clauses                  : 1
% 0.09/0.41  % Current number of unprocessed clauses: 1
% 0.09/0.41  % ...number of literals in the above   : 4
% 0.09/0.41  % Current number of archived formulas  : 0
% 0.09/0.41  % Current number of archived clauses   : 0
% 0.09/0.41  % Clause-clause subsumption calls (NU) : 0
% 0.09/0.41  % Rec. Clause-clause subsumption calls : 0
% 0.09/0.41  % Non-unit clause-clause subsumptions  : 0
% 0.09/0.41  % Unit Clause-clause subsumption calls : 1
% 0.09/0.41  % Rewrite failures with RHS unbound    : 0
% 0.09/0.41  % BW rewrite match attempts            : 0
% 0.09/0.41  % BW rewrite match successes           : 0
% 0.09/0.41  % Condensation attempts                : 0
% 0.09/0.41  % Condensation successes               : 0
% 0.09/0.41  % Termbank termtop insertions          : 973
% 0.09/0.41  % Search garbage collected termcells   : 270
% 0.09/0.41  
% 0.09/0.41  % -------------------------------------------------
% 0.09/0.41  % User time                : 0.005 s
% 0.09/0.41  % System time              : 0.001 s
% 0.09/0.41  % Total time               : 0.006 s
% 0.09/0.41  % Maximum resident set size: 3632 pages
% 0.09/0.41  
% 0.09/0.41  % -------------------------------------------------
% 0.09/0.41  % User time                : 0.005 s
% 0.09/0.41  % System time              : 0.004 s
% 0.09/0.41  % Total time               : 0.009 s
% 0.09/0.41  % Maximum resident set size: 4608 pages
% 0.09/0.41  % E exiting
%------------------------------------------------------------------------------