TSTP Solution File: SET839-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET839-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:08 EDT 2023
% Result : Unsatisfiable 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 6 unt; 7 nHn; 11 RR)
% Number of literals : 41 ( 4 equ; 16 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 41 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_1,negated_conjecture,
( c_lessequals(X1,X2,tc_set(t_a))
| ~ c_in(X2,v_S,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox/tmp/tmp.nCJVKbpKoS/E---3.1_11403.p',cls_conjecture_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.nCJVKbpKoS/E---3.1_11403.p',cls_Set_OsubsetI_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.nCJVKbpKoS/E---3.1_11403.p',cls_Set_Osubset__antisym_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.nCJVKbpKoS/E---3.1_11403.p',cls_Set_OsubsetI_1) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox/tmp/tmp.nCJVKbpKoS/E---3.1_11403.p',cls_Set_OinsertCI_1) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/tmp/tmp.nCJVKbpKoS/E---3.1_11403.p',cls_conjecture_0) ).
cnf(c_0_6,negated_conjecture,
( c_lessequals(X1,X2,tc_set(t_a))
| ~ c_in(X2,v_S,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
cls_conjecture_1 ).
cnf(c_0_7,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_8,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_9,negated_conjecture,
( c_lessequals(X1,c_Main_OsubsetI__1(v_S,X2,tc_set(t_a)),tc_set(t_a))
| c_lessequals(v_S,X2,tc_set(tc_set(t_a)))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)) = X2
| c_lessequals(v_S,X1,tc_set(tc_set(t_a)))
| ~ c_in(X2,v_S,tc_set(t_a))
| ~ c_lessequals(c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)),X2,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,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_12,negated_conjecture,
( c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)) = c_Main_OsubsetI__1(v_S,X2,tc_set(t_a))
| c_lessequals(v_S,X2,tc_set(tc_set(t_a)))
| c_lessequals(v_S,X1,tc_set(tc_set(t_a))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_7]),c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( c_lessequals(v_S,X1,tc_set(tc_set(t_a)))
| c_lessequals(v_S,X2,tc_set(tc_set(t_a)))
| ~ c_in(c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)),X2,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_15,negated_conjecture,
~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))),
cls_conjecture_0 ).
cnf(c_0_16,negated_conjecture,
( c_lessequals(v_S,c_insert(c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)),X2,tc_set(t_a)),tc_set(tc_set(t_a)))
| c_lessequals(v_S,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(v_S,X1,tc_set(tc_set(t_a))),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SET839-2 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.15 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n016.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 2400
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon Oct 2 17:41:36 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.19/0.49 Running first-order model finding
% 0.19/0.49 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.nCJVKbpKoS/E---3.1_11403.p
% 0.19/0.50 # Version: 3.1pre001
% 0.19/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # sh5l with pid 11483 completed with status 0
% 0.19/0.50 # Result found by sh5l
% 0.19/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.50 # Search class: FGUSF-FFSF32-SFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.50 # SAT001_MinMin_p005000_rr_RG with pid 11488 completed with status 0
% 0.19/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.50 # Search class: FGUSF-FFSF32-SFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Unsatisfiable
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 6
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 6
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 6
% 0.19/0.50 # Processed clauses : 19
% 0.19/0.50 # ...of these trivial : 0
% 0.19/0.50 # ...subsumed : 0
% 0.19/0.50 # ...remaining for further processing : 19
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 0
% 0.19/0.50 # Backward-rewritten : 6
% 0.19/0.50 # Generated clauses : 25
% 0.19/0.50 # ...of the previous two non-redundant : 23
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 2
% 0.19/0.50 # Paramodulations : 25
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Total rewrite steps : 8
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 7
% 0.19/0.50 # Positive orientable unit clauses : 3
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 0
% 0.19/0.50 # Non-unit-clauses : 4
% 0.19/0.50 # Current number of unprocessed clauses: 16
% 0.19/0.50 # ...number of literals in the above : 60
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 12
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 26
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 16
% 0.19/0.50 # Non-unit clause-clause subsumptions : 2
% 0.19/0.50 # Unit Clause-clause subsumption calls : 3
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 8
% 0.19/0.50 # BW rewrite match successes : 4
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 863
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.003 s
% 0.19/0.50 # System time : 0.001 s
% 0.19/0.50 # Total time : 0.004 s
% 0.19/0.50 # Maximum resident set size: 1640 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.003 s
% 0.19/0.50 # System time : 0.004 s
% 0.19/0.50 # Total time : 0.007 s
% 0.19/0.50 # Maximum resident set size: 1676 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------