TSTP Solution File: SET821-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET821-2 : 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:20:57 EDT 2023
% Result : Unsatisfiable 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of clauses : 30 ( 11 unt; 13 nHn; 25 RR)
% Number of literals : 66 ( 19 equ; 21 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 43 ( 6 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.aNIWk01Au3/E---3.1_10703.p',cls_Set_OinsertE_0) ).
cnf(cls_conjecture_2,negated_conjecture,
( c_in(v_c,X1,tc_IntDef_Oint)
| c_in(v_a,X1,tc_IntDef_Oint)
| ~ c_in(v_b,X1,tc_IntDef_Oint) ),
file('/export/starexec/sandbox/tmp/tmp.aNIWk01Au3/E---3.1_10703.p',cls_conjecture_2) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox/tmp/tmp.aNIWk01Au3/E---3.1_10703.p',cls_Set_OinsertCI_1) ).
cnf(cls_Set_OComplD__dest_0,axiom,
( ~ c_in(X1,X2,X3)
| ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
file('/export/starexec/sandbox/tmp/tmp.aNIWk01Au3/E---3.1_10703.p',cls_Set_OComplD__dest_0) ).
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.aNIWk01Au3/E---3.1_10703.p',cls_Set_OinsertCI_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_less(v_b,v_c,tc_IntDef_Oint),
file('/export/starexec/sandbox/tmp/tmp.aNIWk01Au3/E---3.1_10703.p',cls_conjecture_1) ).
cnf(cls_Orderings_Oorder__less__irrefl__iff1_0,axiom,
( ~ class_Orderings_Oorder(X1)
| ~ c_less(X2,X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.aNIWk01Au3/E---3.1_10703.p',cls_Orderings_Oorder__less__irrefl__iff1_0) ).
cnf(clsarity_IntDef__Oint_31,axiom,
class_Orderings_Oorder(tc_IntDef_Oint),
file('/export/starexec/sandbox/tmp/tmp.aNIWk01Au3/E---3.1_10703.p',clsarity_IntDef__Oint_31) ).
cnf(cls_conjecture_0,negated_conjecture,
c_less(v_a,v_b,tc_IntDef_Oint),
file('/export/starexec/sandbox/tmp/tmp.aNIWk01Au3/E---3.1_10703.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,negated_conjecture,
( c_in(v_c,X1,tc_IntDef_Oint)
| c_in(v_a,X1,tc_IntDef_Oint)
| ~ c_in(v_b,X1,tc_IntDef_Oint) ),
cls_conjecture_2 ).
cnf(c_0_11,negated_conjecture,
( v_c = X1
| c_in(v_a,c_insert(X1,X2,tc_IntDef_Oint),tc_IntDef_Oint)
| c_in(v_c,X2,tc_IntDef_Oint)
| ~ c_in(v_b,c_insert(X1,X2,tc_IntDef_Oint),tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
( v_c = X1
| v_a = X1
| c_in(v_c,X2,tc_IntDef_Oint)
| c_in(v_a,X2,tc_IntDef_Oint)
| ~ c_in(v_b,c_insert(X1,X2,tc_IntDef_Oint),tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_13,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_14,axiom,
( ~ c_in(X1,X2,X3)
| ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
cls_Set_OComplD__dest_0 ).
cnf(c_0_15,negated_conjecture,
( v_a = v_b
| v_c = v_b
| c_in(v_a,X1,tc_IntDef_Oint)
| c_in(v_c,X1,tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( v_c = v_b
| v_a = v_b
| c_in(v_a,c_uminus(X1,tc_set(tc_IntDef_Oint)),tc_IntDef_Oint)
| ~ c_in(v_c,X1,tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
( v_a = v_b
| v_c = v_b
| ~ c_in(v_a,X1,tc_IntDef_Oint)
| ~ c_in(v_c,X1,tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_18,negated_conjecture,
( v_c = v_b
| v_a = v_b
| ~ c_in(v_a,c_insert(v_c,X1,tc_IntDef_Oint),tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_19,axiom,
( c_in(X1,c_insert(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
cls_Set_OinsertCI_0 ).
cnf(c_0_20,negated_conjecture,
( v_a = v_b
| v_c = v_b
| ~ c_in(v_a,X1,tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
c_less(v_b,v_c,tc_IntDef_Oint),
cls_conjecture_1 ).
cnf(c_0_22,negated_conjecture,
( v_c = v_b
| v_a = v_b ),
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_23,axiom,
( ~ class_Orderings_Oorder(X1)
| ~ c_less(X2,X2,X1) ),
cls_Orderings_Oorder__less__irrefl__iff1_0 ).
cnf(c_0_24,negated_conjecture,
( v_a = v_b
| c_less(v_b,v_b,tc_IntDef_Oint) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,axiom,
class_Orderings_Oorder(tc_IntDef_Oint),
clsarity_IntDef__Oint_31 ).
cnf(c_0_26,negated_conjecture,
c_less(v_a,v_b,tc_IntDef_Oint),
cls_conjecture_0 ).
cnf(c_0_27,negated_conjecture,
v_a = v_b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_28,negated_conjecture,
c_less(v_b,v_b,tc_IntDef_Oint),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_28]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET821-2 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n014.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 : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 17:34:19 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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.aNIWk01Au3/E---3.1_10703.p
% 0.22/0.51 # Version: 3.1pre001
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # sh5l with pid 10793 completed with status 0
% 0.22/0.51 # Result found by sh5l
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.51 # Search class: FGHSF-FFSS32-SFFFFFNN
% 0.22/0.51 # partial match(1): FGHSF-FFMS32-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 0.22/0.51 # G-E--_301_C18_F1_URBAN_S0Y with pid 10801 completed with status 0
% 0.22/0.51 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 0.22/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51 # Starting sh5l with 300s (1) cores
% 0.22/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.51 # Search class: FGHSF-FFSS32-SFFFFFNN
% 0.22/0.51 # partial match(1): FGHSF-FFMS32-SFFFFFNN
% 0.22/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51 # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 0.22/0.51 # Preprocessing time : 0.002 s
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Unsatisfiable
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 10
% 0.22/0.51 # Removed by relevancy pruning/SinE : 0
% 0.22/0.51 # Initial clauses : 10
% 0.22/0.51 # Removed in clause preprocessing : 0
% 0.22/0.51 # Initial clauses in saturation : 10
% 0.22/0.51 # Processed clauses : 24
% 0.22/0.51 # ...of these trivial : 0
% 0.22/0.51 # ...subsumed : 2
% 0.22/0.51 # ...remaining for further processing : 22
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 6
% 0.22/0.51 # Backward-rewritten : 6
% 0.22/0.51 # Generated clauses : 27
% 0.22/0.51 # ...of the previous two non-redundant : 23
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 27
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Total rewrite steps : 9
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 10
% 0.22/0.51 # Positive orientable unit clauses : 5
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 0
% 0.22/0.51 # Non-unit-clauses : 5
% 0.22/0.51 # Current number of unprocessed clauses: 0
% 0.22/0.51 # ...number of literals in the above : 0
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 12
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 54
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 40
% 0.22/0.51 # Non-unit clause-clause subsumptions : 8
% 0.22/0.51 # Unit Clause-clause subsumption calls : 0
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 1
% 0.22/0.51 # BW rewrite match successes : 1
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 590
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.003 s
% 0.22/0.51 # System time : 0.003 s
% 0.22/0.51 # Total time : 0.005 s
% 0.22/0.51 # Maximum resident set size: 1640 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.006 s
% 0.22/0.51 # System time : 0.003 s
% 0.22/0.51 # Total time : 0.009 s
% 0.22/0.51 # Maximum resident set size: 1680 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------