TSTP Solution File: SET840-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET840-1 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:21:03 EDT 2023
% Result : Unsatisfiable 577.01s 73.87s
% Output : CNFRefutation 577.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 34 ( 8 unt; 7 nHn; 21 RR)
% Number of literals : 68 ( 10 equ; 28 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 91 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OinsertE_0,axiom,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
file('/export/starexec/sandbox/tmp/tmp.m549mLK4G5/E---3.1_5360.p',cls_Set_OinsertE_0) ).
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/tmp/tmp.m549mLK4G5/E---3.1_5360.p',cls_Set_OsubsetI_0) ).
cnf(cls_Set_OUnionI_0,axiom,
( c_in(X1,c_Union(X4,X3),X3)
| ~ c_in(X1,X2,X3)
| ~ c_in(X2,X4,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.m549mLK4G5/E---3.1_5360.p',cls_Set_OUnionI_0) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox/tmp/tmp.m549mLK4G5/E---3.1_5360.p',cls_Set_OinsertCI_1) ).
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/tmp/tmp.m549mLK4G5/E---3.1_5360.p',cls_Set_OsubsetI_1) ).
cnf(cls_Set_OinsertCI_0,axiom,
( c_in(X1,c_insert(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.m549mLK4G5/E---3.1_5360.p',cls_Set_OinsertCI_0) ).
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/tmp/tmp.m549mLK4G5/E---3.1_5360.p',cls_Set_Osubset__antisym_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( c_lessequals(c_Union(v_S,t_b),X1,tc_set(t_b))
| ~ c_in(X1,v_S,tc_set(t_b)) ),
file('/export/starexec/sandbox/tmp/tmp.m549mLK4G5/E---3.1_5360.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_b)),tc_set(tc_set(t_b))),
file('/export/starexec/sandbox/tmp/tmp.m549mLK4G5/E---3.1_5360.p',cls_conjecture_0) ).
cnf(c_0_9,axiom,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
cls_Set_OinsertE_0 ).
cnf(c_0_10,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_11,axiom,
( c_in(X1,c_Union(X4,X3),X3)
| ~ c_in(X1,X2,X3)
| ~ c_in(X2,X4,tc_set(X3)) ),
cls_Set_OUnionI_0 ).
cnf(c_0_12,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_13,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
cls_Set_OsubsetI_1 ).
cnf(c_0_14,plain,
( c_Main_OsubsetI__1(c_insert(X1,X2,X3),X4,X3) = X1
| c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3))
| c_in(c_Main_OsubsetI__1(c_insert(X1,X2,X3),X4,X3),X2,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,axiom,
( c_in(X1,c_insert(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
cls_Set_OinsertCI_0 ).
cnf(c_0_16,plain,
( c_in(X1,c_Union(c_insert(X2,X3,tc_set(X4)),X4),X4)
| ~ c_in(X1,X2,X4) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( c_Main_OsubsetI__1(c_insert(X1,X2,X3),X2,X3) = X1
| c_lessequals(c_insert(X1,X2,X3),X2,tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( c_lessequals(X1,c_insert(X2,X3,X4),tc_set(X4))
| ~ c_in(c_Main_OsubsetI__1(X1,c_insert(X2,X3,X4),X4),X3,X4) ),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_19,plain,
( c_lessequals(X1,c_Union(c_insert(X2,X3,tc_set(X4)),X4),tc_set(X4))
| ~ c_in(c_Main_OsubsetI__1(X1,c_Union(c_insert(X2,X3,tc_set(X4)),X4),X4),X2,X4) ),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_20,axiom,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
cls_Set_Osubset__antisym_0 ).
cnf(c_0_21,plain,
( c_lessequals(c_insert(X1,X2,X3),X2,tc_set(X3))
| ~ c_in(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_22,plain,
c_lessequals(X1,c_insert(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_18,c_0_10]) ).
cnf(c_0_23,negated_conjecture,
( c_lessequals(c_Union(v_S,t_b),X1,tc_set(t_b))
| ~ c_in(X1,v_S,tc_set(t_b)) ),
cls_conjecture_1 ).
cnf(c_0_24,plain,
c_lessequals(X1,c_Union(c_insert(X1,X2,tc_set(X3)),X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_19,c_0_10]) ).
cnf(c_0_25,plain,
( c_insert(X1,X2,X3) = X2
| ~ c_in(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_26,negated_conjecture,
( X1 = c_Union(v_S,t_b)
| ~ c_lessequals(X1,c_Union(v_S,t_b),tc_set(t_b))
| ~ c_in(X1,v_S,tc_set(t_b)) ),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_27,plain,
( c_lessequals(X1,c_Union(X2,X3),tc_set(X3))
| ~ c_in(X1,X2,tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( X1 = c_Union(v_S,t_b)
| ~ c_in(X1,v_S,tc_set(t_b)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
( c_Main_OsubsetI__1(v_S,X1,tc_set(t_b)) = c_Union(v_S,t_b)
| c_lessequals(v_S,X1,tc_set(tc_set(t_b))) ),
inference(spm,[status(thm)],[c_0_28,c_0_10]) ).
cnf(c_0_30,negated_conjecture,
( c_lessequals(v_S,X1,tc_set(tc_set(t_b)))
| ~ c_in(c_Union(v_S,t_b),X1,tc_set(t_b)) ),
inference(spm,[status(thm)],[c_0_13,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_b)),tc_set(tc_set(t_b))),
cls_conjecture_0 ).
cnf(c_0_32,negated_conjecture,
c_lessequals(v_S,c_insert(c_Union(v_S,t_b),X1,tc_set(t_b)),tc_set(tc_set(t_b))),
inference(spm,[status(thm)],[c_0_30,c_0_12]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_31,c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.19 % Problem : SET840-1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.20 % Command : run_E %s %d THM
% 0.19/0.39 % Computer : n014.cluster.edu
% 0.19/0.39 % Model : x86_64 x86_64
% 0.19/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.39 % Memory : 8042.1875MB
% 0.19/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.39 % CPULimit : 2400
% 0.19/0.39 % WCLimit : 300
% 0.19/0.39 % DateTime : Mon Oct 2 17:32:04 EDT 2023
% 0.19/0.39 % CPUTime :
% 0.35/0.57 Running first-order theorem proving
% 0.35/0.57 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/tmp/tmp.m549mLK4G5/E---3.1_5360.p
% 577.01/73.87 # Version: 3.1pre001
% 577.01/73.87 # Preprocessing class: FMLMSMSMSSSNFFN.
% 577.01/73.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 577.01/73.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 577.01/73.87 # Starting new_bool_3 with 300s (1) cores
% 577.01/73.87 # Starting new_bool_1 with 300s (1) cores
% 577.01/73.87 # Starting sh5l with 300s (1) cores
% 577.01/73.87 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5438 completed with status 0
% 577.01/73.87 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 577.01/73.87 # Preprocessing class: FMLMSMSMSSSNFFN.
% 577.01/73.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 577.01/73.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 577.01/73.87 # No SInE strategy applied
% 577.01/73.87 # Search class: FGHSM-SSLM33-MFFFFFNN
% 577.01/73.87 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 577.01/73.87 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 577.01/73.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 577.01/73.87 # Starting new_bool_3 with 136s (1) cores
% 577.01/73.87 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 577.01/73.87 # Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 577.01/73.87 # G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 5444 completed with status 0
% 577.01/73.87 # Result found by G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 577.01/73.87 # Preprocessing class: FMLMSMSMSSSNFFN.
% 577.01/73.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 577.01/73.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 577.01/73.87 # No SInE strategy applied
% 577.01/73.87 # Search class: FGHSM-SSLM33-MFFFFFNN
% 577.01/73.87 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 577.01/73.87 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 577.01/73.87 # Preprocessing time : 0.006 s
% 577.01/73.87 # Presaturation interreduction done
% 577.01/73.87
% 577.01/73.87 # Proof found!
% 577.01/73.87 # SZS status Unsatisfiable
% 577.01/73.87 # SZS output start CNFRefutation
% See solution above
% 577.01/73.87 # Parsed axioms : 1359
% 577.01/73.87 # Removed by relevancy pruning/SinE : 0
% 577.01/73.87 # Initial clauses : 1359
% 577.01/73.87 # Removed in clause preprocessing : 1
% 577.01/73.87 # Initial clauses in saturation : 1358
% 577.01/73.87 # Processed clauses : 111701
% 577.01/73.87 # ...of these trivial : 3188
% 577.01/73.87 # ...subsumed : 94018
% 577.01/73.87 # ...remaining for further processing : 14495
% 577.01/73.87 # Other redundant clauses eliminated : 275
% 577.01/73.87 # Clauses deleted for lack of memory : 58043
% 577.01/73.87 # Backward-subsumed : 761
% 577.01/73.87 # Backward-rewritten : 1156
% 577.01/73.87 # Generated clauses : 1773370
% 577.01/73.87 # ...of the previous two non-redundant : 1715130
% 577.01/73.87 # ...aggressively subsumed : 0
% 577.01/73.87 # Contextual simplify-reflections : 28
% 577.01/73.87 # Paramodulations : 1772926
% 577.01/73.87 # Factorizations : 132
% 577.01/73.87 # NegExts : 0
% 577.01/73.87 # Equation resolutions : 312
% 577.01/73.87 # Total rewrite steps : 801327
% 577.01/73.87 # Propositional unsat checks : 2
% 577.01/73.87 # Propositional check models : 0
% 577.01/73.87 # Propositional check unsatisfiable : 0
% 577.01/73.87 # Propositional clauses : 0
% 577.01/73.87 # Propositional clauses after purity: 0
% 577.01/73.87 # Propositional unsat core size : 0
% 577.01/73.87 # Propositional preprocessing time : 0.000
% 577.01/73.87 # Propositional encoding time : 2.727
% 577.01/73.87 # Propositional solver time : 1.031
% 577.01/73.87 # Success case prop preproc time : 0.000
% 577.01/73.87 # Success case prop encoding time : 0.000
% 577.01/73.87 # Success case prop solver time : 0.000
% 577.01/73.87 # Current number of processed clauses : 11256
% 577.01/73.87 # Positive orientable unit clauses : 730
% 577.01/73.87 # Positive unorientable unit clauses: 15
% 577.01/73.87 # Negative unit clauses : 1139
% 577.01/73.87 # Non-unit-clauses : 9372
% 577.01/73.87 # Current number of unprocessed clauses: 874654
% 577.01/73.87 # ...number of literals in the above : 2339320
% 577.01/73.87 # Current number of archived formulas : 0
% 577.01/73.87 # Current number of archived clauses : 3239
% 577.01/73.87 # Clause-clause subsumption calls (NU) : 22634889
% 577.01/73.87 # Rec. Clause-clause subsumption calls : 17566477
% 577.01/73.87 # Non-unit clause-clause subsumptions : 40147
% 577.01/73.87 # Unit Clause-clause subsumption calls : 1670008
% 577.01/73.87 # Rewrite failures with RHS unbound : 0
% 577.01/73.87 # BW rewrite match attempts : 5063
% 577.01/73.87 # BW rewrite match successes : 861
% 577.01/73.87 # Condensation attempts : 0
% 577.01/73.87 # Condensation successes : 0
% 577.01/73.87 # Termbank termtop insertions : 94699337
% 577.01/73.87
% 577.01/73.87 # -------------------------------------------------
% 577.01/73.87 # User time : 68.684 s
% 577.01/73.87 # System time : 1.595 s
% 577.01/73.87 # Total time : 70.279 s
% 577.01/73.87 # Maximum resident set size: 3720 pages
% 577.01/73.87
% 577.01/73.87 # -------------------------------------------------
% 577.01/73.87 # User time : 352.470 s
% 577.01/73.87 # System time : 6.488 s
% 577.01/73.87 # Total time : 358.958 s
% 577.01/73.87 # Maximum resident set size: 2396 pages
% 577.01/73.87 % E---3.1 exiting
% 577.01/73.87 % E---3.1 exiting
%------------------------------------------------------------------------------