TSTP Solution File: SEU614_8 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU614_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:32:36 EDT 2023
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU614_8 : TPTP v8.1.2. Released v8.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n002.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 09:44:29 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.pktvEAbPYD/E---3.1_4934.p
% 0.20/0.49 # Version: 3.1pre001
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # sh5l with pid 5040 completed with status 0
% 0.20/0.49 # Result found by sh5l
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 5045 completed with status 0
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% 0.20/0.49 tff(decl_22, type, in: ($i * $i) > $o).
% 0.20/0.49 tff(decl_23, type, symdiff: ($i * $i) > $i).
% 0.20/0.49 tff(decl_24, type, symdiffE: $o).
% 0.20/0.49 tff(decl_25, type, esk1_0: $i).
% 0.20/0.49 tff(decl_26, type, esk2_0: $i).
% 0.20/0.49 tff(decl_27, type, esk3_0: $i).
% 0.20/0.49 tff(decl_28, type, esk4_0: $i).
% 0.20/0.49 tff(decl_29, type, esk5_0: $i).
% 0.20/0.49 tff(decl_30, type, esk6_0: $i).
% 0.20/0.49 tff(decl_31, type, epred1_0: $o).
% 0.20/0.49 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/sandbox2/tmp/tmp.pktvEAbPYD/E---3.1_4934.p', symdiffE)).
% 0.20/0.49 fof(symdiffIneg1, conjecture, (symdiffE=>![X1, X2, X3]:((in(X3,X1)=>(in(X3,X2)=>~(in(X3,symdiff(X1,X2))))))), file('/export/starexec/sandbox2/tmp/tmp.pktvEAbPYD/E---3.1_4934.p', symdiffIneg1)).
% 0.20/0.49 fof(c_0_2, 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.20/0.49 fof(c_0_3, negated_conjecture, ~((symdiffE=>![X1, X2, X3]:((in(X3,X1)=>(in(X3,X2)=>~in(X3,symdiff(X1,X2))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[symdiffIneg1])])).
% 0.20/0.49 fof(c_0_4, 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(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])).
% 0.20/0.49 fof(c_0_5, negated_conjecture, (symdiffE&(in(esk3_0,esk1_0)&(in(esk3_0,esk2_0)&in(esk3_0,symdiff(esk1_0,esk2_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])).
% 0.20/0.49 cnf(c_0_6, plain, (~in(X1,X2)|~in(X1,X3)|~in(X1,symdiff(X2,X3))|~symdiffE), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_4])])])).
% 0.20/0.49 cnf(c_0_7, negated_conjecture, (symdiffE), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.20/0.49 cnf(c_0_8, plain, (~in(X1,symdiff(X2,X3))|~in(X1,X3)|~in(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6, c_0_7])])).
% 0.20/0.49 cnf(c_0_9, negated_conjecture, (in(esk3_0,symdiff(esk1_0,esk2_0))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.20/0.49 cnf(c_0_10, negated_conjecture, (in(esk3_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.20/0.49 cnf(c_0_11, negated_conjecture, (in(esk3_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.20/0.49 cnf(c_0_12, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10]), c_0_11])]), ['proof']).
% 0.20/0.49 # SZS output end CNFRefutation
% 0.20/0.49 # Parsed axioms : 5
% 0.20/0.49 # Removed by relevancy pruning/SinE : 3
% 0.20/0.49 # Initial clauses : 17
% 0.20/0.49 # Removed in clause preprocessing : 7
% 0.20/0.49 # Initial clauses in saturation : 10
% 0.20/0.49 # Processed clauses : 15
% 0.20/0.49 # ...of these trivial : 4
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 11
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 1
% 0.20/0.49 # ...of the previous two non-redundant : 0
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 1
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Total rewrite steps : 8
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 5
% 0.20/0.49 # Positive orientable unit clauses : 4
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 0
% 0.20/0.49 # Non-unit-clauses : 1
% 0.20/0.49 # Current number of unprocessed clauses: 1
% 0.20/0.49 # ...number of literals in the above : 3
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 6
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 875
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.005 s
% 0.20/0.49 # Maximum resident set size: 1744 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1680 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------