TSTP Solution File: SET859-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET859-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:09 EDT 2023
% Result : Timeout 1.70s 300.07s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 8 RR)
% Number of literals : 15 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 18 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_Osubset__trans_0,axiom,
( c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X1,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.A0UM3Dmn1L/E---3.1_26325.p',cls_Set_Osubset__trans_0) ).
cnf(cls_Zorn_OAbrial__axiom1_0,axiom,
c_lessequals(X1,c_Zorn_Osucc(X2,X1,X3),tc_set(tc_set(X3))),
file('/export/starexec/sandbox2/tmp/tmp.A0UM3Dmn1L/E---3.1_26325.p',cls_Zorn_OAbrial__axiom1_0) ).
cnf(cls_conjecture_2,negated_conjecture,
c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/tmp/tmp.A0UM3Dmn1L/E---3.1_26325.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_lessequals(v_n,v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/tmp/tmp.A0UM3Dmn1L/E---3.1_26325.p',cls_conjecture_3) ).
cnf(c_0_4,axiom,
( c_lessequals(X4,X2,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X4,X1,tc_set(X3)) ),
cls_Set_Osubset__trans_0 ).
cnf(c_0_5,axiom,
c_lessequals(X1,c_Zorn_Osucc(X2,X1,X3),tc_set(tc_set(X3))),
cls_Zorn_OAbrial__axiom1_0 ).
cnf(c_0_6,plain,
( c_lessequals(X1,X2,tc_set(tc_set(X3)))
| ~ c_lessequals(c_Zorn_Osucc(X4,X1,X3),X2,tc_set(tc_set(X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,negated_conjecture,
c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),v_m,tc_set(tc_set(t_a))),
cls_conjecture_2 ).
cnf(c_0_8,negated_conjecture,
~ c_lessequals(v_n,v_m,tc_set(tc_set(t_a))),
cls_conjecture_3 ).
cnf(c_0_9,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.18 % Problem : SET859-1 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.19 % Command : run_E %s %d THM
% 0.19/0.40 % Computer : n018.cluster.edu
% 0.19/0.40 % Model : x86_64 x86_64
% 0.19/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.40 % Memory : 8042.1875MB
% 0.19/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.40 % CPULimit : 2400
% 0.19/0.40 % WCLimit : 300
% 0.19/0.40 % DateTime : Mon Oct 2 18:07:39 EDT 2023
% 0.19/0.40 % CPUTime :
% 0.25/0.60 Running first-order theorem proving
% 0.25/0.60 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.A0UM3Dmn1L/E---3.1_26325.p
% 1.70/300.07 # Version: 3.1pre001
% 1.70/300.07 # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.70/300.07 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.70/300.07 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.70/300.07 # Starting new_bool_3 with 300s (1) cores
% 1.70/300.07 # Starting new_bool_1 with 300s (1) cores
% 1.70/300.07 # Starting sh5l with 300s (1) cores
% 1.70/300.07 # new_bool_3 with pid 26407 completed with status 0
% 1.70/300.07 # Result found by new_bool_3
% 1.70/300.07 # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.70/300.07 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.70/300.07 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.70/300.07 # Starting new_bool_3 with 300s (1) cores
% 1.70/300.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.70/300.07 # Search class: FGHSM-FSLM32-SFFFFFNN
% 1.70/300.07 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.70/300.07 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 127s (1) cores
% 1.70/300.07 # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 26411 completed with status 0
% 1.70/300.07 # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 1.70/300.07 # Preprocessing class: FMLMSMSMSSSNFFN.
% 1.70/300.07 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.70/300.07 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.70/300.07 # Starting new_bool_3 with 300s (1) cores
% 1.70/300.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.70/300.07 # Search class: FGHSM-FSLM32-SFFFFFNN
% 1.70/300.07 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.70/300.07 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 127s (1) cores
% 1.70/300.07 # Preprocessing time : 0.003 s
% 1.70/300.07
% 1.70/300.07 # Proof found!
% 1.70/300.07 # SZS status Unsatisfiable
% 1.70/300.07 # SZS output start CNFRefutation
% See solution above
% 1.70/300.07 # Parsed axioms : 1369
% 1.70/300.07 # Removed by relevancy pruning/SinE : 997
% 1.70/300.07 # Initial clauses : 372
% 1.70/300.07 # Removed in clause preprocessing : 0
% 1.70/300.07 # Initial clauses in saturation : 372
% 1.70/300.07 # Processed clauses : 481
% 1.70/300.07 # ...of these trivial : 0
% 1.70/300.07 # ...subsumed : 71
% 1.70/300.07 # ...remaining for further processing : 410
% 1.70/300.07 # Other redundant clauses eliminated : 0
% 1.70/300.07 # Clauses deleted for lack of memory : 0
% 1.70/300.07 # Backward-subsumed : 1
% 1.70/300.07 # Backward-rewritten : 1
% 1.70/300.07 # Generated clauses : 192
% 1.70/300.07 # ...of the previous two non-redundant : 123
% 1.70/300.07 # ...aggressively subsumed : 0
% 1.70/300.07 # Contextual simplify-reflections : 0
% 1.70/300.07 # Paramodulations : 192
% 1.70/300.07 # Factorizations : 0
% 1.70/300.07 # NegExts : 0
% 1.70/300.07 # Equation resolutions : 0
% 1.70/300.07 # Total rewrite steps : 70
% 1.70/300.07 # Propositional unsat checks : 0
% 1.70/300.07 # Propositional check models : 0
% 1.70/300.07 # Propositional check unsatisfiable : 0
% 1.70/300.07 # Propositional clauses : 0
% 1.70/300.07 # Propositional clauses after purity: 0
% 1.70/300.07 # Propositional unsat core size : 0
% 1.70/300.07 # Propositional preprocessing time : 0.000
% 1.70/300.07 # Propositional encoding time : 0.000
% 1.70/300.07 # Propositional solver time : 0.000
% 1.70/300.07 # Success case prop preproc time : 0.000
% 1.70/300.07 # Success case prop encoding time : 0.000
% 1.70/300.07 # Success case prop solver time : 0.000
% 1.70/300.07 # Current number of processed clauses : 408
% 1.70/300.07 # Positive orientable unit clauses : 45
% 1.70/300.07 # Positive unorientable unit clauses: 0
% 1.70/300.07 # Negative unit clauses : 12
% 1.70/300.07 # Non-unit-clauses : 351
% 1.70/300.07 # Current number of unprocessed clauses: 13
% 1.70/300.07 # ...number of literals in the above : 33
% 1.70/300.07 # Current number of archived formulas : 0
% 1.70/300.07 # Current number of archived clauses : 2
% 1.70/300.07 # Clause-clause subsumption calls (NU) : 28663
% 1.70/300.07 # Rec. Clause-clause subsumption calls : 27468
% 1.70/300.07 # Non-unit clause-clause subsumptions : 70
% 1.70/300.07 # Unit Clause-clause subsumption calls : 84
% 1.70/300.07 # Rewrite failures with RHS unbound : 0
% 1.70/300.07 # BW rewrite match attempts : 10
% 1.70/300.07 # BW rewrite match successes : 1
% 1.70/300.07 # Condensation attempts : 0
% 1.70/300.07 # Condensation successes : 0
% 1.70/300.07 # Termbank termtop insertions : 14557
% 1.70/300.07
% 1.70/300.07 # -------------------------------------------------
% 1.70/300.07 # User time : 0.019 s
% 1.70/300.07 # System time : 0.007 s
% 1.70/300.07 # Total time : 0.026 s
% 1.70/300.07 # Maximum resident set size: 2980 pages
% 1.70/300.07
% 1.70/300.07 # -------------------------------------------------
% 1.70/300.07 # User time : 0.037 s
% 1.70/300.07 # System time : 0.009 s
% 1.70/300.07 # Total time : 0.046 s
% 1.70/300.07 # Maximum resident set size: 2408 pages
% 1.70/300.07 % E---3.1 exiting
% 1.70/300.07 % E---3.1 exiting
%------------------------------------------------------------------------------