TSTP Solution File: SWV254-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---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 : 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 05:21:56 EDT 2024
% Result : Unsatisfiable 3.89s 1.12s
% Output : CNFRefutation 3.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 17 unt; 0 nHn; 9 RR)
% Number of literals : 26 ( 14 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 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 : 29 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_SetInterval_OatLeastLessThan__empty_0,axiom,
( c_SetInterval_OatLeastLessThan(X3,X2,X1) = c_emptyset
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_SetInterval_OatLeastLessThan__empty_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(clsarity_nat_3,axiom,
class_Orderings_Oorder(tc_nat),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsarity_nat_3) ).
cnf(cls_SetInterval_OatLeastLessThan__singleton_0,axiom,
c_SetInterval_OatLeastLessThan(X1,c_Suc(X1),tc_nat) = c_insert(X1,c_emptyset,tc_nat),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_SetInterval_OatLeastLessThan__singleton_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(cls_Set_Oempty__not__insert_0,axiom,
c_emptyset != c_insert(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_Oempty__not__insert_0) ).
cnf(c_0_7,plain,
( c_SetInterval_OatLeastLessThan(X3,X2,X1) = c_emptyset
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_SetInterval_OatLeastLessThan__empty_0]) ).
cnf(c_0_8,negated_conjecture,
c_lessequals(X1,v_x(X1),tc_nat),
cls_conjecture_0 ).
cnf(c_0_9,negated_conjecture,
v_x(X1) = v_nat,
cls_conjecture_1 ).
cnf(c_0_10,plain,
( c_SetInterval_OatLeastLessThan(X3,X2,X1) = c_emptyset
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1) ),
c_0_7 ).
cnf(c_0_11,negated_conjecture,
c_lessequals(X1,v_nat,tc_nat),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
class_Orderings_Oorder(tc_nat),
clsarity_nat_3 ).
cnf(c_0_13,axiom,
c_SetInterval_OatLeastLessThan(X1,c_Suc(X1),tc_nat) = c_insert(X1,c_emptyset,tc_nat),
cls_SetInterval_OatLeastLessThan__singleton_0 ).
cnf(c_0_14,axiom,
c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat) = c_Suc(X1),
cls_SetInterval_Ocard__atMost_0 ).
cnf(c_0_15,plain,
c_emptyset != c_insert(X1,X2,X3),
inference(fof_simplification,[status(thm)],[cls_Set_Oempty__not__insert_0]) ).
cnf(c_0_16,negated_conjecture,
c_SetInterval_OatLeastLessThan(v_nat,X1,tc_nat) = c_emptyset,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_17,plain,
c_SetInterval_OatLeastLessThan(X1,c_Finite__Set_Ocard(c_SetInterval_OatMost(X1,tc_nat),tc_nat),tc_nat) = c_insert(X1,c_emptyset,tc_nat),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
c_emptyset != c_insert(X1,X2,X3),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV254-1 : TPTP v8.2.0. Released v3.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 09:30:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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/benchmark/theBenchmark.p
% 3.89/1.12 # Version: 3.1.0
% 3.89/1.12 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.89/1.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.89/1.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.89/1.12 # Starting new_bool_3 with 300s (1) cores
% 3.89/1.12 # Starting new_bool_1 with 300s (1) cores
% 3.89/1.12 # Starting sh5l with 300s (1) cores
% 3.89/1.12 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 17836 completed with status 0
% 3.89/1.12 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.89/1.12 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.89/1.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.89/1.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.89/1.12 # No SInE strategy applied
% 3.89/1.12 # Search class: FGHSM-SMLM32-DFFFFFNN
% 3.89/1.12 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 3.89/1.12 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 3.89/1.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.89/1.12 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 3.89/1.12 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 3.89/1.12 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 113s (1) cores
% 3.89/1.12 # G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 17850 completed with status 0
% 3.89/1.12 # Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 3.89/1.12 # Preprocessing class: FMLMSMSMSSSNFFN.
% 3.89/1.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.89/1.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.89/1.12 # No SInE strategy applied
% 3.89/1.12 # Search class: FGHSM-SMLM32-DFFFFFNN
% 3.89/1.12 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 3.89/1.12 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 3.89/1.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.89/1.12 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 3.89/1.12 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 3.89/1.12 # Preprocessing time : 0.027 s
% 3.89/1.12 # Presaturation interreduction done
% 3.89/1.12
% 3.89/1.12 # Proof found!
% 3.89/1.12 # SZS status Unsatisfiable
% 3.89/1.12 # SZS output start CNFRefutation
% See solution above
% 3.89/1.12 # Parsed axioms : 2789
% 3.89/1.12 # Removed by relevancy pruning/SinE : 0
% 3.89/1.12 # Initial clauses : 2789
% 3.89/1.12 # Removed in clause preprocessing : 10
% 3.89/1.12 # Initial clauses in saturation : 2779
% 3.89/1.12 # Processed clauses : 5253
% 3.89/1.12 # ...of these trivial : 30
% 3.89/1.12 # ...subsumed : 873
% 3.89/1.12 # ...remaining for further processing : 4350
% 3.89/1.12 # Other redundant clauses eliminated : 21
% 3.89/1.12 # Clauses deleted for lack of memory : 0
% 3.89/1.12 # Backward-subsumed : 10
% 3.89/1.12 # Backward-rewritten : 53
% 3.89/1.12 # Generated clauses : 5027
% 3.89/1.12 # ...of the previous two non-redundant : 4024
% 3.89/1.12 # ...aggressively subsumed : 0
% 3.89/1.12 # Contextual simplify-reflections : 6
% 3.89/1.12 # Paramodulations : 4965
% 3.89/1.12 # Factorizations : 0
% 3.89/1.12 # NegExts : 0
% 3.89/1.12 # Equation resolutions : 62
% 3.89/1.12 # Disequality decompositions : 0
% 3.89/1.12 # Total rewrite steps : 1643
% 3.89/1.12 # ...of those cached : 1298
% 3.89/1.12 # Propositional unsat checks : 0
% 3.89/1.12 # Propositional check models : 0
% 3.89/1.12 # Propositional check unsatisfiable : 0
% 3.89/1.12 # Propositional clauses : 0
% 3.89/1.12 # Propositional clauses after purity: 0
% 3.89/1.12 # Propositional unsat core size : 0
% 3.89/1.12 # Propositional preprocessing time : 0.000
% 3.89/1.12 # Propositional encoding time : 0.000
% 3.89/1.12 # Propositional solver time : 0.000
% 3.89/1.12 # Success case prop preproc time : 0.000
% 3.89/1.12 # Success case prop encoding time : 0.000
% 3.89/1.12 # Success case prop solver time : 0.000
% 3.89/1.12 # Current number of processed clauses : 1644
% 3.89/1.12 # Positive orientable unit clauses : 391
% 3.89/1.12 # Positive unorientable unit clauses: 3
% 3.89/1.12 # Negative unit clauses : 68
% 3.89/1.12 # Non-unit-clauses : 1182
% 3.89/1.12 # Current number of unprocessed clauses: 3968
% 3.89/1.12 # ...number of literals in the above : 8909
% 3.89/1.12 # Current number of archived formulas : 0
% 3.89/1.12 # Current number of archived clauses : 2715
% 3.89/1.12 # Clause-clause subsumption calls (NU) : 2573022
% 3.89/1.12 # Rec. Clause-clause subsumption calls : 1629051
% 3.89/1.12 # Non-unit clause-clause subsumptions : 757
% 3.89/1.12 # Unit Clause-clause subsumption calls : 87950
% 3.89/1.12 # Rewrite failures with RHS unbound : 0
% 3.89/1.12 # BW rewrite match attempts : 509
% 3.89/1.12 # BW rewrite match successes : 50
% 3.89/1.12 # Condensation attempts : 0
% 3.89/1.12 # Condensation successes : 0
% 3.89/1.12 # Termbank termtop insertions : 128387
% 3.89/1.12 # Search garbage collected termcells : 4030
% 3.89/1.12
% 3.89/1.12 # -------------------------------------------------
% 3.89/1.12 # User time : 0.502 s
% 3.89/1.12 # System time : 0.023 s
% 3.89/1.12 # Total time : 0.525 s
% 3.89/1.12 # Maximum resident set size: 6764 pages
% 3.89/1.12
% 3.89/1.12 # -------------------------------------------------
% 3.89/1.12 # User time : 2.369 s
% 3.89/1.12 # System time : 0.093 s
% 3.89/1.12 # Total time : 2.462 s
% 3.89/1.12 # Maximum resident set size: 3492 pages
% 3.89/1.12 % E---3.1 exiting
% 4.46/1.13 % E exiting
%------------------------------------------------------------------------------