TSTP Solution File: SET839-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET839-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 02:56:12 EDT 2024
% Result : Unsatisfiable 36.49s 5.21s
% Output : CNFRefutation 36.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 23 ( 7 unt; 6 nHn; 15 RR)
% Number of literals : 49 ( 6 equ; 22 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 50 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_Osubset__antisym_0,axiom,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__antisym_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( c_lessequals(X1,X2,tc_set(t_a))
| ~ c_in(X2,v_S,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Set_OsubsetI_0,axiom,
( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_0) ).
cnf(cls_Set_OsubsetI_1,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_1) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OinsertCI_1) ).
cnf(c_0_6,plain,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_Osubset__antisym_0]) ).
cnf(c_0_7,negated_conjecture,
( c_lessequals(X1,X2,tc_set(t_a))
| ~ c_in(X2,v_S,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_8,plain,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
c_0_6 ).
cnf(c_0_9,negated_conjecture,
( c_lessequals(X1,X2,tc_set(t_a))
| ~ c_in(X2,v_S,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
c_0_7 ).
cnf(c_0_10,negated_conjecture,
( X1 = X2
| ~ c_in(X1,v_S,tc_set(t_a))
| ~ c_in(X2,v_S,tc_set(t_a)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
cnf(c_0_11,axiom,
( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
cls_Set_OsubsetI_0 ).
cnf(c_0_12,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetI_1]) ).
cnf(c_0_13,negated_conjecture,
( c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)) = X2
| c_lessequals(v_S,X1,tc_set(tc_set(t_a)))
| ~ c_in(X2,v_S,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
c_0_12 ).
cnf(c_0_15,negated_conjecture,
( c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)) = c_Main_OsubsetI__1(v_S,X2,tc_set(t_a))
| c_lessequals(v_S,X2,tc_set(tc_set(t_a)))
| c_lessequals(v_S,X1,tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_17,negated_conjecture,
( c_lessequals(v_S,X1,tc_set(tc_set(t_a)))
| c_lessequals(v_S,X2,tc_set(tc_set(t_a)))
| ~ c_in(c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)),X2,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_19,negated_conjecture,
~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))),
c_0_16 ).
cnf(c_0_20,negated_conjecture,
( c_lessequals(v_S,c_insert(c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)),X2,tc_set(t_a)),tc_set(tc_set(t_a)))
| c_lessequals(v_S,X1,tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
c_lessequals(v_S,X1,tc_set(tc_set(t_a))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : SET839-1 : TPTP v8.2.0. Released v3.2.0.
% 0.09/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n016.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 11:22:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 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
% 36.49/5.21 # Version: 3.1.0
% 36.49/5.21 # Preprocessing class: FMLMSMSMSSSNFFN.
% 36.49/5.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.49/5.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 36.49/5.21 # Starting new_bool_3 with 300s (1) cores
% 36.49/5.21 # Starting new_bool_1 with 300s (1) cores
% 36.49/5.21 # Starting sh5l with 300s (1) cores
% 36.49/5.21 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2563 completed with status 0
% 36.49/5.21 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 36.49/5.21 # Preprocessing class: FMLMSMSMSSSNFFN.
% 36.49/5.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.49/5.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 36.49/5.21 # No SInE strategy applied
% 36.49/5.21 # Search class: FGHSM-SSLM33-MFFFFFNN
% 36.49/5.21 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 36.49/5.21 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 36.49/5.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 36.49/5.21 # Starting new_bool_3 with 136s (1) cores
% 36.49/5.21 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 36.49/5.21 # Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 36.49/5.21 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2571 completed with status 0
% 36.49/5.21 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 36.49/5.21 # Preprocessing class: FMLMSMSMSSSNFFN.
% 36.49/5.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.49/5.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 36.49/5.21 # No SInE strategy applied
% 36.49/5.21 # Search class: FGHSM-SSLM33-MFFFFFNN
% 36.49/5.21 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 36.49/5.21 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 36.49/5.21 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 36.49/5.21 # Preprocessing time : 0.011 s
% 36.49/5.21 # Presaturation interreduction done
% 36.49/5.21
% 36.49/5.21 # Proof found!
% 36.49/5.21 # SZS status Unsatisfiable
% 36.49/5.21 # SZS output start CNFRefutation
% See solution above
% 36.49/5.21 # Parsed axioms : 1359
% 36.49/5.21 # Removed by relevancy pruning/SinE : 0
% 36.49/5.21 # Initial clauses : 1359
% 36.49/5.21 # Removed in clause preprocessing : 1
% 36.49/5.21 # Initial clauses in saturation : 1358
% 36.49/5.21 # Processed clauses : 14877
% 36.49/5.21 # ...of these trivial : 195
% 36.49/5.21 # ...subsumed : 9587
% 36.49/5.21 # ...remaining for further processing : 5095
% 36.49/5.21 # Other redundant clauses eliminated : 123
% 36.49/5.21 # Clauses deleted for lack of memory : 0
% 36.49/5.21 # Backward-subsumed : 299
% 36.49/5.21 # Backward-rewritten : 281
% 36.49/5.21 # Generated clauses : 101517
% 36.49/5.21 # ...of the previous two non-redundant : 97635
% 36.49/5.21 # ...aggressively subsumed : 0
% 36.49/5.21 # Contextual simplify-reflections : 22
% 36.49/5.21 # Paramodulations : 101350
% 36.49/5.21 # Factorizations : 4
% 36.49/5.21 # NegExts : 0
% 36.49/5.21 # Equation resolutions : 161
% 36.49/5.21 # Disequality decompositions : 0
% 36.49/5.21 # Total rewrite steps : 28506
% 36.49/5.21 # ...of those cached : 24920
% 36.49/5.21 # Propositional unsat checks : 1
% 36.49/5.21 # Propositional check models : 0
% 36.49/5.21 # Propositional check unsatisfiable : 0
% 36.49/5.21 # Propositional clauses : 0
% 36.49/5.21 # Propositional clauses after purity: 0
% 36.49/5.21 # Propositional unsat core size : 0
% 36.49/5.21 # Propositional preprocessing time : 0.000
% 36.49/5.21 # Propositional encoding time : 0.451
% 36.49/5.21 # Propositional solver time : 0.198
% 36.49/5.21 # Success case prop preproc time : 0.000
% 36.49/5.21 # Success case prop encoding time : 0.000
% 36.49/5.21 # Success case prop solver time : 0.000
% 36.49/5.21 # Current number of processed clauses : 3191
% 36.49/5.21 # Positive orientable unit clauses : 331
% 36.49/5.21 # Positive unorientable unit clauses: 0
% 36.49/5.21 # Negative unit clauses : 142
% 36.49/5.21 # Non-unit-clauses : 2718
% 36.49/5.21 # Current number of unprocessed clauses: 84113
% 36.49/5.21 # ...number of literals in the above : 245072
% 36.49/5.21 # Current number of archived formulas : 0
% 36.49/5.21 # Current number of archived clauses : 1904
% 36.49/5.21 # Clause-clause subsumption calls (NU) : 4472299
% 36.49/5.21 # Rec. Clause-clause subsumption calls : 3598217
% 36.49/5.21 # Non-unit clause-clause subsumptions : 5887
% 36.49/5.21 # Unit Clause-clause subsumption calls : 35565
% 36.49/5.21 # Rewrite failures with RHS unbound : 0
% 36.49/5.21 # BW rewrite match attempts : 349
% 36.49/5.21 # BW rewrite match successes : 187
% 36.49/5.21 # Condensation attempts : 0
% 36.49/5.21 # Condensation successes : 0
% 36.49/5.21 # Termbank termtop insertions : 6825642
% 36.49/5.21 # Search garbage collected termcells : 1595
% 36.49/5.21
% 36.49/5.21 # -------------------------------------------------
% 36.49/5.21 # User time : 4.338 s
% 36.49/5.21 # System time : 0.134 s
% 36.49/5.21 # Total time : 4.472 s
% 36.49/5.21 # Maximum resident set size: 3880 pages
% 36.49/5.21
% 36.49/5.21 # -------------------------------------------------
% 36.49/5.21 # User time : 21.781 s
% 36.49/5.21 # System time : 0.610 s
% 36.49/5.21 # Total time : 22.391 s
% 36.49/5.21 # Maximum resident set size: 2404 pages
% 36.49/5.21 % E---3.1 exiting
% 36.49/5.21 % E exiting
%------------------------------------------------------------------------------