TSTP Solution File: SET842-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET842-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:24:09 EDT 2023
% Result : Timeout 408.30s 300.15s
% Output : None
% 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.SWJRmPOGBB/E---3.1_6341.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.SWJRmPOGBB/E---3.1_6341.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.SWJRmPOGBB/E---3.1_6341.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.SWJRmPOGBB/E---3.1_6341.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.SWJRmPOGBB/E---3.1_6341.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.SWJRmPOGBB/E---3.1_6341.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.SWJRmPOGBB/E---3.1_6341.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_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),X1,tc_set(t_a)),v_m,tc_set(t_a))
| c_lessequals(c_Union(v_Y,tc_set(t_a)),X1,tc_set(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.12 % Problem : SET842-2 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.33 % Computer : n002.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 2400
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon Oct 2 17:06:29 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.SWJRmPOGBB/E---3.1_6341.p
% 408.30/300.15 # Version: 3.1pre001
% 408.30/300.15 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.30/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.30/300.15 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.30/300.15 # Starting new_bool_3 with 300s (1) cores
% 408.30/300.15 # Starting new_bool_1 with 300s (1) cores
% 408.30/300.15 # Starting sh5l with 300s (1) cores
% 408.30/300.15 # sh5l with pid 6427 completed with status 0
% 408.30/300.15 # Result found by sh5l
% 408.30/300.15 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.30/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.30/300.15 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.30/300.15 # Starting new_bool_3 with 300s (1) cores
% 408.30/300.15 # Starting new_bool_1 with 300s (1) cores
% 408.30/300.15 # Starting sh5l with 300s (1) cores
% 408.30/300.15 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.30/300.15 # Search class: FGUNF-FFSF32-SFFFFFNN
% 408.30/300.15 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.30/300.15 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.30/300.15 # SAT001_MinMin_p005000_rr_RG with pid 6432 completed with status 0
% 408.30/300.15 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.30/300.15 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.30/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.30/300.15 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.30/300.15 # Starting new_bool_3 with 300s (1) cores
% 408.30/300.15 # Starting new_bool_1 with 300s (1) cores
% 408.30/300.15 # Starting sh5l with 300s (1) cores
% 408.30/300.15 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.30/300.15 # Search class: FGUNF-FFSF32-SFFFFFNN
% 408.30/300.15 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.30/300.15 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.30/300.15 # Preprocessing time : 0.001 s
% 408.30/300.15 # Presaturation interreduction done
% 408.30/300.15
% 408.30/300.15 # Proof found!
% 408.30/300.15 # SZS status Unsatisfiable
% 408.30/300.15 # SZS output start CNFRefutation
% See solution above
% 408.30/300.15 # Parsed axioms : 7
% 408.30/300.15 # Removed by relevancy pruning/SinE : 0
% 408.30/300.15 # Initial clauses : 7
% 408.30/300.15 # Removed in clause preprocessing : 0
% 408.30/300.15 # Initial clauses in saturation : 7
% 408.30/300.15 # Processed clauses : 23
% 408.30/300.15 # ...of these trivial : 0
% 408.30/300.15 # ...subsumed : 0
% 408.30/300.15 # ...remaining for further processing : 23
% 408.30/300.15 # Other redundant clauses eliminated : 0
% 408.30/300.15 # Clauses deleted for lack of memory : 0
% 408.30/300.15 # Backward-subsumed : 0
% 408.30/300.15 # Backward-rewritten : 0
% 408.30/300.15 # Generated clauses : 14
% 408.30/300.15 # ...of the previous two non-redundant : 12
% 408.30/300.15 # ...aggressively subsumed : 0
% 408.30/300.15 # Contextual simplify-reflections : 0
% 408.30/300.15 # Paramodulations : 14
% 408.30/300.15 # Factorizations : 0
% 408.30/300.15 # NegExts : 0
% 408.30/300.15 # Equation resolutions : 0
% 408.30/300.15 # Total rewrite steps : 0
% 408.30/300.15 # Propositional unsat checks : 0
% 408.30/300.15 # Propositional check models : 0
% 408.30/300.15 # Propositional check unsatisfiable : 0
% 408.30/300.15 # Propositional clauses : 0
% 408.30/300.15 # Propositional clauses after purity: 0
% 408.30/300.15 # Propositional unsat core size : 0
% 408.30/300.15 # Propositional preprocessing time : 0.000
% 408.30/300.15 # Propositional encoding time : 0.000
% 408.30/300.15 # Propositional solver time : 0.000
% 408.30/300.15 # Success case prop preproc time : 0.000
% 408.30/300.15 # Success case prop encoding time : 0.000
% 408.30/300.15 # Success case prop solver time : 0.000
% 408.30/300.15 # Current number of processed clauses : 16
% 408.30/300.15 # Positive orientable unit clauses : 1
% 408.30/300.15 # Positive unorientable unit clauses: 0
% 408.30/300.15 # Negative unit clauses : 2
% 408.30/300.15 # Non-unit-clauses : 13
% 408.30/300.15 # Current number of unprocessed clauses: 3
% 408.30/300.15 # ...number of literals in the above : 9
% 408.30/300.15 # Current number of archived formulas : 0
% 408.30/300.15 # Current number of archived clauses : 7
% 408.30/300.15 # Clause-clause subsumption calls (NU) : 31
% 408.30/300.15 # Rec. Clause-clause subsumption calls : 30
% 408.30/300.15 # Non-unit clause-clause subsumptions : 0
% 408.30/300.15 # Unit Clause-clause subsumption calls : 3
% 408.30/300.15 # Rewrite failures with RHS unbound : 0
% 408.30/300.15 # BW rewrite match attempts : 4
% 408.30/300.15 # BW rewrite match successes : 0
% 408.30/300.15 # Condensation attempts : 0
% 408.30/300.15 # Condensation successes : 0
% 408.30/300.15 # Termbank termtop insertions : 650
% 408.30/300.15
% 408.30/300.15 # -------------------------------------------------
% 408.30/300.15 # User time : 0.002 s
% 408.30/300.15 # System time : 0.002 s
% 408.30/300.15 # Total time : 0.004 s
% 408.30/300.15 # Maximum resident set size: 1640 pages
% 408.30/300.15
% 408.30/300.15 # -------------------------------------------------
% 408.30/300.15 # User time : 0.003 s
% 408.30/300.15 # System time : 0.004 s
% 408.30/300.15 # Total time : 0.007 s
% 408.30/300.15 # Maximum resident set size: 1676 pages
% 408.30/300.15 % E---3.1 exiting
%------------------------------------------------------------------------------