TSTP Solution File: SET840-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET840-2 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 03:00:06 EDT 2024
% Result : Unsatisfiable 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of clauses : 41 ( 9 unt; 8 nHn; 27 RR)
% Number of literals : 84 ( 12 equ; 37 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 : 111 ( 12 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/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertE_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/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnionI_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/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_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/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).
cnf(cls_Set_OinsertCI_0,axiom,
( c_in(X1,c_insert(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertCI_0) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertCI_1) ).
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/sandbox2/benchmark/theBenchmark.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/sandbox2/benchmark/theBenchmark.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/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_9,plain,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
inference(fof_simplification,[status(thm)],[cls_Set_OinsertE_0]) ).
cnf(c_0_10,plain,
( c_in(X1,c_Union(X4,X3),X3)
| ~ c_in(X1,X2,X3)
| ~ c_in(X2,X4,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnionI_0]) ).
cnf(c_0_11,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_12,plain,
( c_in(X1,X3,X4)
| X1 = X2
| ~ c_in(X1,c_insert(X2,X3,X4),X4) ),
c_0_9 ).
cnf(c_0_13,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_14,plain,
( c_in(X1,c_insert(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OinsertCI_0]) ).
cnf(c_0_15,plain,
( c_in(X1,c_Union(X4,X3),X3)
| ~ c_in(X1,X2,X3)
| ~ c_in(X2,X4,tc_set(X3)) ),
c_0_10 ).
cnf(c_0_16,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_17,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
c_0_11 ).
cnf(c_0_18,plain,
( c_Main_OsubsetI__1(c_insert(X1,X2,X3),X4,X3) = X1
| c_in(c_Main_OsubsetI__1(c_insert(X1,X2,X3),X4,X3),X2,X3)
| c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( c_in(X1,c_insert(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
c_0_14 ).
cnf(c_0_20,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_15,c_0_16]) ).
cnf(c_0_21,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_22,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_17,c_0_18]) ).
cnf(c_0_23,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_17,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( c_lessequals(c_Union(v_S,t_b),X1,tc_set(t_b))
| ~ c_in(X1,v_S,tc_set(t_b)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_25,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_17,c_0_20]) ).
cnf(c_0_26,plain,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
c_0_21 ).
cnf(c_0_27,plain,
( c_lessequals(c_insert(X1,X2,X3),X2,tc_set(X3))
| ~ c_in(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_28,plain,
c_lessequals(X1,c_insert(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_29,negated_conjecture,
( c_lessequals(c_Union(v_S,t_b),X1,tc_set(t_b))
| ~ c_in(X1,v_S,tc_set(t_b)) ),
c_0_24 ).
cnf(c_0_30,plain,
c_lessequals(X1,c_Union(c_insert(X1,X2,tc_set(X3)),X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_31,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_26,c_0_27]),c_0_28])]) ).
cnf(c_0_32,negated_conjecture,
( X1 = c_Union(v_S,t_b)
| ~ c_in(X1,v_S,tc_set(t_b))
| ~ c_lessequals(X1,c_Union(v_S,t_b),tc_set(t_b)) ),
inference(spm,[status(thm)],[c_0_26,c_0_29]) ).
cnf(c_0_33,plain,
( c_lessequals(X1,c_Union(X2,X3),tc_set(X3))
| ~ c_in(X1,X2,tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( X1 = c_Union(v_S,t_b)
| ~ c_in(X1,v_S,tc_set(t_b)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,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_34,c_0_13]) ).
cnf(c_0_36,negated_conjecture,
~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_b)),tc_set(tc_set(t_b))),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_37,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_17,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_b)),tc_set(tc_set(t_b))),
c_0_36 ).
cnf(c_0_39,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_37,c_0_16]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_38,c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET840-2 : TPTP v8.2.0. Released v3.2.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.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 : Mon May 20 11:50:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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
% 0.19/0.48 # Version: 3.1.0
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # sh5l with pid 17481 completed with status 0
% 0.19/0.48 # Result found by sh5l
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.48 # Search class: FGUSF-FFSF32-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48 # SAT001_MinMin_p005000_rr_RG with pid 17489 completed with status 0
% 0.19/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.48 # Search class: FGUSF-FFSF32-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Unsatisfiable
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 9
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 9
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 9
% 0.19/0.48 # Processed clauses : 69
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 17
% 0.19/0.48 # ...remaining for further processing : 52
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 3
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 165
% 0.19/0.48 # ...of the previous two non-redundant : 142
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 165
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 15
% 0.19/0.48 # ...of those cached : 6
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 40
% 0.19/0.48 # Positive orientable unit clauses : 7
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 1
% 0.19/0.48 # Non-unit-clauses : 32
% 0.19/0.48 # Current number of unprocessed clauses: 90
% 0.19/0.48 # ...number of literals in the above : 238
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 12
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 156
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 152
% 0.19/0.48 # Non-unit clause-clause subsumptions : 20
% 0.19/0.48 # Unit Clause-clause subsumption calls : 10
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 10
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 3048
% 0.19/0.48 # Search garbage collected termcells : 23
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.007 s
% 0.19/0.48 # System time : 0.001 s
% 0.19/0.48 # Total time : 0.008 s
% 0.19/0.48 # Maximum resident set size: 1604 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.009 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.011 s
% 0.19/0.48 # Maximum resident set size: 1696 pages
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------