TSTP Solution File: SWV689-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV689-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:55:08 EDT 2023
% Result : Unsatisfiable 0.43s 0.64s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 5 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 6 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
~ c_HOL_Oord__class_Oless(c_HOL_Ominus__class_Ominus(v_i,v_k,tc_nat),v_n,tc_nat),
file('/export/starexec/sandbox2/tmp/tmp.c0sgtAncnZ/E---3.1_8061.p',cls_conjecture_0) ).
cnf(cls_less__imp__diff__less_0,axiom,
( c_HOL_Oord__class_Oless(c_HOL_Ominus__class_Ominus(X1,X2,tc_nat),X3,tc_nat)
| ~ c_HOL_Oord__class_Oless(X1,X3,tc_nat) ),
file('/export/starexec/sandbox2/tmp/tmp.c0sgtAncnZ/E---3.1_8061.p',cls_less__imp__diff__less_0) ).
cnf(cls_assms_0,axiom,
c_HOL_Oord__class_Oless(v_i,v_n,tc_nat),
file('/export/starexec/sandbox2/tmp/tmp.c0sgtAncnZ/E---3.1_8061.p',cls_assms_0) ).
cnf(c_0_3,negated_conjecture,
~ c_HOL_Oord__class_Oless(c_HOL_Ominus__class_Ominus(v_i,v_k,tc_nat),v_n,tc_nat),
cls_conjecture_0 ).
cnf(c_0_4,axiom,
( c_HOL_Oord__class_Oless(c_HOL_Ominus__class_Ominus(X1,X2,tc_nat),X3,tc_nat)
| ~ c_HOL_Oord__class_Oless(X1,X3,tc_nat) ),
cls_less__imp__diff__less_0 ).
cnf(c_0_5,axiom,
c_HOL_Oord__class_Oless(v_i,v_n,tc_nat),
cls_assms_0 ).
cnf(c_0_6,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.19 % Problem : SWV689-1 : TPTP v8.1.2. Released v4.1.0.
% 0.12/0.20 % Command : run_E %s %d THM
% 0.20/0.40 % Computer : n028.cluster.edu
% 0.20/0.40 % Model : x86_64 x86_64
% 0.20/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.40 % Memory : 8042.1875MB
% 0.20/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.40 % CPULimit : 2400
% 0.20/0.40 % WCLimit : 300
% 0.20/0.40 % DateTime : Tue Oct 3 04:46:52 EDT 2023
% 0.20/0.40 % CPUTime :
% 0.36/0.61 Running first-order theorem proving
% 0.36/0.61 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/tmp/tmp.c0sgtAncnZ/E---3.1_8061.p
% 0.43/0.64 # Version: 3.1pre001
% 0.43/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.43/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.43/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.43/0.64 # Starting new_bool_1 with 300s (1) cores
% 0.43/0.64 # Starting sh5l with 300s (1) cores
% 0.43/0.64 # new_bool_3 with pid 8140 completed with status 0
% 0.43/0.64 # Result found by new_bool_3
% 0.43/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.43/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.43/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.43/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.43/0.64 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.43/0.64 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.43/0.64 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.43/0.64 # G-E--_303_C18_F1_URBAN_S0Y with pid 8143 completed with status 0
% 0.43/0.64 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 0.43/0.64 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.43/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.64 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.43/0.64 # Starting new_bool_3 with 300s (1) cores
% 0.43/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.43/0.64 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.43/0.64 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.43/0.64 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.43/0.64 # Preprocessing time : 0.004 s
% 0.43/0.64
% 0.43/0.64 # Proof found!
% 0.43/0.64 # SZS status Unsatisfiable
% 0.43/0.64 # SZS output start CNFRefutation
% See solution above
% 0.43/0.64 # Parsed axioms : 798
% 0.43/0.64 # Removed by relevancy pruning/SinE : 537
% 0.43/0.64 # Initial clauses : 261
% 0.43/0.64 # Removed in clause preprocessing : 0
% 0.43/0.64 # Initial clauses in saturation : 261
% 0.43/0.64 # Processed clauses : 57
% 0.43/0.64 # ...of these trivial : 7
% 0.43/0.64 # ...subsumed : 11
% 0.43/0.64 # ...remaining for further processing : 39
% 0.43/0.64 # Other redundant clauses eliminated : 0
% 0.43/0.64 # Clauses deleted for lack of memory : 0
% 0.43/0.64 # Backward-subsumed : 0
% 0.43/0.64 # Backward-rewritten : 5
% 0.43/0.64 # Generated clauses : 57
% 0.43/0.64 # ...of the previous two non-redundant : 37
% 0.43/0.64 # ...aggressively subsumed : 0
% 0.43/0.64 # Contextual simplify-reflections : 0
% 0.43/0.64 # Paramodulations : 51
% 0.43/0.64 # Factorizations : 4
% 0.43/0.64 # NegExts : 0
% 0.43/0.64 # Equation resolutions : 2
% 0.43/0.64 # Total rewrite steps : 20
% 0.43/0.64 # Propositional unsat checks : 0
% 0.43/0.64 # Propositional check models : 0
% 0.43/0.64 # Propositional check unsatisfiable : 0
% 0.43/0.64 # Propositional clauses : 0
% 0.43/0.64 # Propositional clauses after purity: 0
% 0.43/0.64 # Propositional unsat core size : 0
% 0.43/0.64 # Propositional preprocessing time : 0.000
% 0.43/0.64 # Propositional encoding time : 0.000
% 0.43/0.64 # Propositional solver time : 0.000
% 0.43/0.64 # Success case prop preproc time : 0.000
% 0.43/0.64 # Success case prop encoding time : 0.000
% 0.43/0.64 # Success case prop solver time : 0.000
% 0.43/0.64 # Current number of processed clauses : 34
% 0.43/0.64 # Positive orientable unit clauses : 14
% 0.43/0.64 # Positive unorientable unit clauses: 0
% 0.43/0.64 # Negative unit clauses : 8
% 0.43/0.64 # Non-unit-clauses : 12
% 0.43/0.64 # Current number of unprocessed clauses: 238
% 0.43/0.64 # ...number of literals in the above : 501
% 0.43/0.64 # Current number of archived formulas : 0
% 0.43/0.64 # Current number of archived clauses : 5
% 0.43/0.64 # Clause-clause subsumption calls (NU) : 31
% 0.43/0.64 # Rec. Clause-clause subsumption calls : 31
% 0.43/0.64 # Non-unit clause-clause subsumptions : 4
% 0.43/0.64 # Unit Clause-clause subsumption calls : 9
% 0.43/0.64 # Rewrite failures with RHS unbound : 0
% 0.43/0.64 # BW rewrite match attempts : 6
% 0.43/0.64 # BW rewrite match successes : 5
% 0.43/0.64 # Condensation attempts : 0
% 0.43/0.64 # Condensation successes : 0
% 0.43/0.64 # Termbank termtop insertions : 11761
% 0.43/0.64
% 0.43/0.64 # -------------------------------------------------
% 0.43/0.64 # User time : 0.008 s
% 0.43/0.64 # System time : 0.001 s
% 0.43/0.64 # Total time : 0.009 s
% 0.43/0.64 # Maximum resident set size: 2508 pages
% 0.43/0.64
% 0.43/0.64 # -------------------------------------------------
% 0.43/0.64 # User time : 0.020 s
% 0.43/0.64 # System time : 0.004 s
% 0.43/0.64 # Total time : 0.023 s
% 0.43/0.64 # Maximum resident set size: 2208 pages
% 0.43/0.64 % E---3.1 exiting
% 0.43/0.65 % E---3.1 exiting
%------------------------------------------------------------------------------