TSTP Solution File: SET842-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET842-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 0.44s 0.91s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 3 unt; 3 nHn; 16 RR)
% Number of literals : 39 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OsubsetD_0,axiom,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.12qPvfFiVR/E---3.1_22626.p',cls_Set_OsubsetD_0) ).
cnf(cls_conjecture_4,negated_conjecture,
( c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X1,v_Y,tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox/tmp/tmp.12qPvfFiVR/E---3.1_22626.p',cls_conjecture_4) ).
cnf(cls_Set_OUnionE_0,axiom,
( c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3))
| ~ c_in(X1,c_Union(X2,X3),X3) ),
file('/export/starexec/sandbox/tmp/tmp.12qPvfFiVR/E---3.1_22626.p',cls_Set_OUnionE_0) ).
cnf(cls_Set_OUnionE_1,axiom,
( c_in(X1,c_Main_OUnionE__1(X1,X2,X3),X3)
| ~ c_in(X1,c_Union(X2,X3),X3) ),
file('/export/starexec/sandbox/tmp/tmp.12qPvfFiVR/E---3.1_22626.p',cls_Set_OUnionE_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/tmp/tmp.12qPvfFiVR/E---3.1_22626.p',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/tmp/tmp.12qPvfFiVR/E---3.1_22626.p',cls_Set_OsubsetI_1) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/tmp/tmp.12qPvfFiVR/E---3.1_22626.p',cls_conjecture_3) ).
cnf(c_0_7,axiom,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
cls_Set_OsubsetD_0 ).
cnf(c_0_8,negated_conjecture,
( c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X1,v_Y,tc_set(tc_set(t_a))) ),
cls_conjecture_4 ).
cnf(c_0_9,negated_conjecture,
( c_in(X1,v_m,tc_set(t_a))
| ~ c_in(X2,v_Y,tc_set(tc_set(t_a)))
| ~ c_in(X1,X2,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
( c_in(c_Main_OUnionE__1(X1,X2,X3),X2,tc_set(X3))
| ~ c_in(X1,c_Union(X2,X3),X3) ),
cls_Set_OUnionE_0 ).
cnf(c_0_11,negated_conjecture,
( c_in(X1,v_m,tc_set(t_a))
| ~ c_in(X1,c_Main_OUnionE__1(X2,v_Y,tc_set(t_a)),tc_set(t_a))
| ~ c_in(X2,c_Union(v_Y,tc_set(t_a)),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
( c_in(X1,c_Main_OUnionE__1(X1,X2,X3),X3)
| ~ c_in(X1,c_Union(X2,X3),X3) ),
cls_Set_OUnionE_1 ).
cnf(c_0_13,negated_conjecture,
( c_in(X1,v_m,tc_set(t_a))
| ~ c_in(X1,c_Union(v_Y,tc_set(t_a)),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,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_15,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_16,negated_conjecture,
( c_lessequals(c_Union(v_Y,tc_set(t_a)),X1,tc_set(tc_set(t_a)))
| c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),X1,tc_set(t_a)),v_m,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
cls_conjecture_3 ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.20 % Problem : SET842-1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.21 % Command : run_E %s %d THM
% 0.20/0.41 % Computer : n018.cluster.edu
% 0.20/0.41 % Model : x86_64 x86_64
% 0.20/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.41 % Memory : 8042.1875MB
% 0.20/0.41 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.41 % CPULimit : 2400
% 0.20/0.41 % WCLimit : 300
% 0.20/0.41 % DateTime : Mon Oct 2 17:10:53 EDT 2023
% 0.20/0.41 % CPUTime :
% 0.42/0.61 Running first-order theorem proving
% 0.42/0.61 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.12qPvfFiVR/E---3.1_22626.p
% 0.44/0.91 # Version: 3.1pre001
% 0.44/0.91 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.44/0.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.91 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.44/0.91 # Starting new_bool_3 with 300s (1) cores
% 0.44/0.91 # Starting new_bool_1 with 300s (1) cores
% 0.44/0.91 # Starting sh5l with 300s (1) cores
% 0.44/0.91 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22704 completed with status 0
% 0.44/0.91 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.44/0.91 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.44/0.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.91 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.44/0.91 # No SInE strategy applied
% 0.44/0.91 # Search class: FGHSM-SSLM33-MFFFFFNN
% 0.44/0.91 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.44/0.91 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.44/0.91 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.44/0.91 # Starting new_bool_3 with 136s (1) cores
% 0.44/0.91 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.44/0.91 # Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.44/0.91 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22711 completed with status 0
% 0.44/0.91 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.44/0.91 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.44/0.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.91 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.44/0.91 # No SInE strategy applied
% 0.44/0.91 # Search class: FGHSM-SSLM33-MFFFFFNN
% 0.44/0.91 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.44/0.91 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.44/0.91 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.44/0.91 # Preprocessing time : 0.009 s
% 0.44/0.91 # Presaturation interreduction done
% 0.44/0.91
% 0.44/0.91 # Proof found!
% 0.44/0.91 # SZS status Unsatisfiable
% 0.44/0.91 # SZS output start CNFRefutation
% See solution above
% 0.44/0.91 # Parsed axioms : 1363
% 0.44/0.91 # Removed by relevancy pruning/SinE : 0
% 0.44/0.91 # Initial clauses : 1363
% 0.44/0.91 # Removed in clause preprocessing : 1
% 0.44/0.91 # Initial clauses in saturation : 1362
% 0.44/0.91 # Processed clauses : 5426
% 0.44/0.91 # ...of these trivial : 9
% 0.44/0.91 # ...subsumed : 2700
% 0.44/0.91 # ...remaining for further processing : 2717
% 0.44/0.91 # Other redundant clauses eliminated : 31
% 0.44/0.91 # Clauses deleted for lack of memory : 0
% 0.44/0.91 # Backward-subsumed : 0
% 0.44/0.91 # Backward-rewritten : 6
% 0.44/0.91 # Generated clauses : 4671
% 0.44/0.91 # ...of the previous two non-redundant : 3763
% 0.44/0.91 # ...aggressively subsumed : 0
% 0.44/0.91 # Contextual simplify-reflections : 1
% 0.44/0.91 # Paramodulations : 4610
% 0.44/0.91 # Factorizations : 0
% 0.44/0.91 # NegExts : 0
% 0.44/0.91 # Equation resolutions : 61
% 0.44/0.91 # Total rewrite steps : 838
% 0.44/0.91 # Propositional unsat checks : 0
% 0.44/0.91 # Propositional check models : 0
% 0.44/0.91 # Propositional check unsatisfiable : 0
% 0.44/0.91 # Propositional clauses : 0
% 0.44/0.91 # Propositional clauses after purity: 0
% 0.44/0.91 # Propositional unsat core size : 0
% 0.44/0.91 # Propositional preprocessing time : 0.000
% 0.44/0.91 # Propositional encoding time : 0.000
% 0.44/0.91 # Propositional solver time : 0.000
% 0.44/0.91 # Success case prop preproc time : 0.000
% 0.44/0.91 # Success case prop encoding time : 0.000
% 0.44/0.91 # Success case prop solver time : 0.000
% 0.44/0.91 # Current number of processed clauses : 1385
% 0.44/0.91 # Positive orientable unit clauses : 186
% 0.44/0.91 # Positive unorientable unit clauses: 0
% 0.44/0.91 # Negative unit clauses : 29
% 0.44/0.91 # Non-unit-clauses : 1170
% 0.44/0.91 # Current number of unprocessed clauses: 1021
% 0.44/0.91 # ...number of literals in the above : 2583
% 0.44/0.91 # Current number of archived formulas : 0
% 0.44/0.91 # Current number of archived clauses : 1332
% 0.44/0.91 # Clause-clause subsumption calls (NU) : 1275350
% 0.44/0.91 # Rec. Clause-clause subsumption calls : 1201016
% 0.44/0.91 # Non-unit clause-clause subsumptions : 2679
% 0.44/0.91 # Unit Clause-clause subsumption calls : 14713
% 0.44/0.91 # Rewrite failures with RHS unbound : 0
% 0.44/0.91 # BW rewrite match attempts : 74
% 0.44/0.91 # BW rewrite match successes : 6
% 0.44/0.91 # Condensation attempts : 0
% 0.44/0.91 # Condensation successes : 0
% 0.44/0.91 # Termbank termtop insertions : 72646
% 0.44/0.91
% 0.44/0.91 # -------------------------------------------------
% 0.44/0.91 # User time : 0.257 s
% 0.44/0.91 # System time : 0.011 s
% 0.44/0.91 # Total time : 0.268 s
% 0.44/0.91 # Maximum resident set size: 3728 pages
% 0.44/0.91
% 0.44/0.91 # -------------------------------------------------
% 0.44/0.91 # User time : 1.255 s
% 0.44/0.91 # System time : 0.042 s
% 0.44/0.91 # Total time : 1.297 s
% 0.44/0.91 # Maximum resident set size: 2400 pages
% 0.44/0.91 % E---3.1 exiting
% 2.57/0.91 % E---3.1 exiting
%------------------------------------------------------------------------------