TSTP Solution File: SWV254-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWV254-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 05:33:50 EDT 2024
% Result : Unsatisfiable 1.80s 1.05s
% Output : CNFRefutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 35 ( 25 unt; 0 nHn; 15 RR)
% Number of literals : 45 ( 17 equ; 14 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 52 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Nat_Odiff__is__0__eq_H_0,axiom,
( c_minus(X1,X2,tc_nat) = c_0
| ~ c_lessequals(X1,X2,tc_nat) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Nat_Odiff__is__0__eq_H_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(X1,v_x(X1),tc_nat),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
v_x(X1) = v_nat,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Nat_Ole__add__diff__inverse_0,axiom,
( c_plus(X1,c_minus(X2,X1,tc_nat),tc_nat) = X2
| ~ c_lessequals(X1,X2,tc_nat) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Nat_Ole__add__diff__inverse_0) ).
cnf(cls_Nat_Oadd__leE_0,axiom,
( c_lessequals(X2,X3,tc_nat)
| ~ c_lessequals(c_plus(X1,X2,tc_nat),X3,tc_nat) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Nat_Oadd__leE_0) ).
cnf(cls_Nat_Odiff__le__self_0,axiom,
c_lessequals(c_minus(X1,X2,tc_nat),X1,tc_nat),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Nat_Odiff__le__self_0) ).
cnf(cls_Nat_Oop_A_N_Odiff__0_0,axiom,
c_minus(X1,c_0,tc_nat) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Nat_Oop_A_N_Odiff__0_0) ).
cnf(cls_Nat_Oadd__0__right_0,axiom,
c_plus(X1,c_0,tc_nat) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Nat_Oadd__0__right_0) ).
cnf(cls_Nat_Onot__add__less1_0,axiom,
~ c_less(c_plus(X1,X2,tc_nat),X1,tc_nat),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Nat_Onot__add__less1_0) ).
cnf(cls_Nat_OlessI_0,axiom,
c_less(X1,c_Suc(X1),tc_nat),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Nat_OlessI_0) ).
cnf(cls_SetInterval_Ocard__atMost_0,axiom,
c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat) = c_Suc(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_SetInterval_Ocard__atMost_0) ).
cnf(c_0_11,plain,
( c_minus(X1,X2,tc_nat) = c_0
| ~ c_lessequals(X1,X2,tc_nat) ),
inference(fof_simplification,[status(thm)],[cls_Nat_Odiff__is__0__eq_H_0]) ).
cnf(c_0_12,negated_conjecture,
c_lessequals(X1,v_x(X1),tc_nat),
cls_conjecture_0 ).
cnf(c_0_13,negated_conjecture,
v_x(X1) = v_nat,
cls_conjecture_1 ).
cnf(c_0_14,plain,
( c_plus(X1,c_minus(X2,X1,tc_nat),tc_nat) = X2
| ~ c_lessequals(X1,X2,tc_nat) ),
inference(fof_simplification,[status(thm)],[cls_Nat_Ole__add__diff__inverse_0]) ).
cnf(c_0_15,plain,
( c_minus(X1,X2,tc_nat) = c_0
| ~ c_lessequals(X1,X2,tc_nat) ),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
c_lessequals(X1,v_nat,tc_nat),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( c_lessequals(X2,X3,tc_nat)
| ~ c_lessequals(c_plus(X1,X2,tc_nat),X3,tc_nat) ),
inference(fof_simplification,[status(thm)],[cls_Nat_Oadd__leE_0]) ).
cnf(c_0_18,axiom,
c_lessequals(c_minus(X1,X2,tc_nat),X1,tc_nat),
cls_Nat_Odiff__le__self_0 ).
cnf(c_0_19,axiom,
c_minus(X1,c_0,tc_nat) = X1,
cls_Nat_Oop_A_N_Odiff__0_0 ).
cnf(c_0_20,plain,
( c_plus(X1,c_minus(X2,X1,tc_nat),tc_nat) = X2
| ~ c_lessequals(X1,X2,tc_nat) ),
c_0_14 ).
cnf(c_0_21,negated_conjecture,
c_minus(X1,v_nat,tc_nat) = c_0,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,axiom,
c_plus(X1,c_0,tc_nat) = X1,
cls_Nat_Oadd__0__right_0 ).
cnf(c_0_23,plain,
( c_lessequals(X2,X3,tc_nat)
| ~ c_lessequals(c_plus(X1,X2,tc_nat),X3,tc_nat) ),
c_0_17 ).
cnf(c_0_24,plain,
c_lessequals(X1,X1,tc_nat),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
~ c_less(c_plus(X1,X2,tc_nat),X1,tc_nat),
inference(fof_simplification,[status(thm)],[cls_Nat_Onot__add__less1_0]) ).
cnf(c_0_26,negated_conjecture,
( v_nat = X1
| ~ c_lessequals(v_nat,X1,tc_nat) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_27,plain,
c_lessequals(X1,c_plus(X2,X1,tc_nat),tc_nat),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
~ c_less(c_plus(X1,X2,tc_nat),X1,tc_nat),
c_0_25 ).
cnf(c_0_29,negated_conjecture,
c_plus(X1,v_nat,tc_nat) = v_nat,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,axiom,
c_less(X1,c_Suc(X1),tc_nat),
cls_Nat_OlessI_0 ).
cnf(c_0_31,axiom,
c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat) = c_Suc(X1),
cls_SetInterval_Ocard__atMost_0 ).
cnf(c_0_32,negated_conjecture,
~ c_less(v_nat,X1,tc_nat),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
c_less(X1,c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat),tc_nat),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_32,c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV254-1 : TPTP v8.2.0. Released v3.2.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 09:31:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 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/benchmark/theBenchmark.p
% 1.80/1.05 # Version: 3.1.0
% 1.80/1.05 # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.80/1.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.80/1.05 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.80/1.05 # Starting new_bool_3 with 300s (1) cores
% 1.80/1.05 # Starting new_bool_1 with 300s (1) cores
% 1.80/1.05 # Starting sh5l with 300s (1) cores
% 1.80/1.05 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18554 completed with status 0
% 1.80/1.05 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.80/1.05 # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.80/1.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.80/1.05 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.80/1.05 # No SInE strategy applied
% 1.80/1.05 # Search class: FGHSM-SMLM32-DFFFFFNN
% 1.80/1.05 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 1.80/1.05 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 1.80/1.05 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.80/1.05 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 1.80/1.05 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 1.80/1.05 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 113s (1) cores
% 1.80/1.05 # G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with pid 18569 completed with status 0
% 1.80/1.05 # Result found by G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN
% 1.80/1.05 # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.80/1.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.80/1.05 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.80/1.05 # No SInE strategy applied
% 1.80/1.05 # Search class: FGHSM-SMLM32-DFFFFFNN
% 1.80/1.05 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 1.80/1.05 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 1.80/1.05 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.80/1.05 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 1.80/1.05 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 1.80/1.05 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 113s (1) cores
% 1.80/1.05 # Preprocessing time : 0.024 s
% 1.80/1.05 # Presaturation interreduction done
% 1.80/1.05
% 1.80/1.05 # Proof found!
% 1.80/1.05 # SZS status Unsatisfiable
% 1.80/1.05 # SZS output start CNFRefutation
% See solution above
% 1.80/1.05 # Parsed axioms : 2789
% 1.80/1.05 # Removed by relevancy pruning/SinE : 0
% 1.80/1.05 # Initial clauses : 2789
% 1.80/1.05 # Removed in clause preprocessing : 10
% 1.80/1.05 # Initial clauses in saturation : 2779
% 1.80/1.05 # Processed clauses : 4672
% 1.80/1.05 # ...of these trivial : 29
% 1.80/1.05 # ...subsumed : 226
% 1.80/1.05 # ...remaining for further processing : 4417
% 1.80/1.05 # Other redundant clauses eliminated : 15
% 1.80/1.05 # Clauses deleted for lack of memory : 0
% 1.80/1.05 # Backward-subsumed : 5
% 1.80/1.05 # Backward-rewritten : 48
% 1.80/1.05 # Generated clauses : 2273
% 1.80/1.05 # ...of the previous two non-redundant : 706
% 1.80/1.05 # ...aggressively subsumed : 0
% 1.80/1.05 # Contextual simplify-reflections : 2
% 1.80/1.05 # Paramodulations : 2212
% 1.80/1.05 # Factorizations : 8
% 1.80/1.05 # NegExts : 0
% 1.80/1.05 # Equation resolutions : 53
% 1.80/1.05 # Disequality decompositions : 0
% 1.80/1.05 # Total rewrite steps : 2028
% 1.80/1.05 # ...of those cached : 1649
% 1.80/1.05 # Propositional unsat checks : 0
% 1.80/1.05 # Propositional check models : 0
% 1.80/1.05 # Propositional check unsatisfiable : 0
% 1.80/1.05 # Propositional clauses : 0
% 1.80/1.05 # Propositional clauses after purity: 0
% 1.80/1.05 # Propositional unsat core size : 0
% 1.80/1.05 # Propositional preprocessing time : 0.000
% 1.80/1.05 # Propositional encoding time : 0.000
% 1.80/1.05 # Propositional solver time : 0.000
% 1.80/1.05 # Success case prop preproc time : 0.000
% 1.80/1.05 # Success case prop encoding time : 0.000
% 1.80/1.05 # Success case prop solver time : 0.000
% 1.80/1.05 # Current number of processed clauses : 1710
% 1.80/1.05 # Positive orientable unit clauses : 456
% 1.80/1.05 # Positive unorientable unit clauses: 1
% 1.80/1.05 # Negative unit clauses : 79
% 1.80/1.05 # Non-unit-clauses : 1174
% 1.80/1.05 # Current number of unprocessed clauses: 1467
% 1.80/1.05 # ...number of literals in the above : 3686
% 1.80/1.05 # Current number of archived formulas : 0
% 1.80/1.05 # Current number of archived clauses : 2716
% 1.80/1.05 # Clause-clause subsumption calls (NU) : 2369147
% 1.80/1.05 # Rec. Clause-clause subsumption calls : 1420118
% 1.80/1.05 # Non-unit clause-clause subsumptions : 110
% 1.80/1.05 # Unit Clause-clause subsumption calls : 103718
% 1.80/1.05 # Rewrite failures with RHS unbound : 1
% 1.80/1.05 # BW rewrite match attempts : 757
% 1.80/1.05 # BW rewrite match successes : 103
% 1.80/1.05 # Condensation attempts : 0
% 1.80/1.05 # Condensation successes : 0
% 1.80/1.05 # Termbank termtop insertions : 114407
% 1.80/1.05 # Search garbage collected termcells : 4030
% 1.80/1.05
% 1.80/1.05 # -------------------------------------------------
% 1.80/1.05 # User time : 0.497 s
% 1.80/1.05 # System time : 0.014 s
% 1.80/1.05 # Total time : 0.511 s
% 1.80/1.05 # Maximum resident set size: 6768 pages
% 1.80/1.05
% 1.80/1.05 # -------------------------------------------------
% 1.80/1.05 # User time : 2.360 s
% 1.80/1.05 # System time : 0.064 s
% 1.80/1.05 # Total time : 2.424 s
% 1.80/1.05 # Maximum resident set size: 3492 pages
% 1.80/1.05 % E---3.1 exiting
%------------------------------------------------------------------------------