TSTP Solution File: SET859-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET859-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 0.34s 300.29s
% 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.EGhpURGi8o/E---3.1_26039.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.EGhpURGi8o/E---3.1_26039.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.EGhpURGi8o/E---3.1_26039.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.EGhpURGi8o/E---3.1_26039.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.12/0.12 % Problem : SET859-2 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 18:11:06 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.EGhpURGi8o/E---3.1_26039.p
% 0.34/300.29 # Version: 3.1pre001
% 0.34/300.29 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.34/300.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/300.29 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.34/300.29 # Starting new_bool_3 with 300s (1) cores
% 0.34/300.29 # Starting new_bool_1 with 300s (1) cores
% 0.34/300.29 # Starting sh5l with 300s (1) cores
% 0.34/300.29 # new_bool_3 with pid 26118 completed with status 0
% 0.34/300.29 # Result found by new_bool_3
% 0.34/300.29 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.34/300.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/300.29 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.34/300.29 # Starting new_bool_3 with 300s (1) cores
% 0.34/300.29 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/300.29 # Search class: FHUNF-FFSF32-SFFFFFNN
% 0.34/300.29 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.34/300.29 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.34/300.29 # SAT001_MinMin_p005000_rr_RG with pid 26123 completed with status 0
% 0.34/300.29 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.34/300.29 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.34/300.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/300.29 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.34/300.29 # Starting new_bool_3 with 300s (1) cores
% 0.34/300.29 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/300.29 # Search class: FHUNF-FFSF32-SFFFFFNN
% 0.34/300.29 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.34/300.29 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.34/300.29 # Preprocessing time : 0.001 s
% 0.34/300.29 # Presaturation interreduction done
% 0.34/300.29
% 0.34/300.29 # Proof found!
% 0.34/300.29 # SZS status Unsatisfiable
% 0.34/300.29 # SZS output start CNFRefutation
% See solution above
% 0.34/300.29 # Parsed axioms : 4
% 0.34/300.29 # Removed by relevancy pruning/SinE : 0
% 0.34/300.29 # Initial clauses : 4
% 0.34/300.29 # Removed in clause preprocessing : 0
% 0.34/300.29 # Initial clauses in saturation : 4
% 0.34/300.29 # Processed clauses : 9
% 0.34/300.29 # ...of these trivial : 0
% 0.34/300.29 # ...subsumed : 0
% 0.34/300.29 # ...remaining for further processing : 9
% 0.34/300.29 # Other redundant clauses eliminated : 0
% 0.34/300.29 # Clauses deleted for lack of memory : 0
% 0.34/300.29 # Backward-subsumed : 0
% 0.34/300.29 # Backward-rewritten : 0
% 0.34/300.29 # Generated clauses : 4
% 0.34/300.29 # ...of the previous two non-redundant : 3
% 0.34/300.29 # ...aggressively subsumed : 0
% 0.34/300.29 # Contextual simplify-reflections : 0
% 0.34/300.29 # Paramodulations : 4
% 0.34/300.29 # Factorizations : 0
% 0.34/300.29 # NegExts : 0
% 0.34/300.29 # Equation resolutions : 0
% 0.34/300.29 # Total rewrite steps : 0
% 0.34/300.29 # Propositional unsat checks : 0
% 0.34/300.29 # Propositional check models : 0
% 0.34/300.29 # Propositional check unsatisfiable : 0
% 0.34/300.29 # Propositional clauses : 0
% 0.34/300.29 # Propositional clauses after purity: 0
% 0.34/300.29 # Propositional unsat core size : 0
% 0.34/300.29 # Propositional preprocessing time : 0.000
% 0.34/300.29 # Propositional encoding time : 0.000
% 0.34/300.29 # Propositional solver time : 0.000
% 0.34/300.29 # Success case prop preproc time : 0.000
% 0.34/300.29 # Success case prop encoding time : 0.000
% 0.34/300.29 # Success case prop solver time : 0.000
% 0.34/300.29 # Current number of processed clauses : 5
% 0.34/300.29 # Positive orientable unit clauses : 2
% 0.34/300.29 # Positive unorientable unit clauses: 0
% 0.34/300.29 # Negative unit clauses : 1
% 0.34/300.29 # Non-unit-clauses : 2
% 0.34/300.29 # Current number of unprocessed clauses: 1
% 0.34/300.29 # ...number of literals in the above : 2
% 0.34/300.29 # Current number of archived formulas : 0
% 0.34/300.29 # Current number of archived clauses : 4
% 0.34/300.29 # Clause-clause subsumption calls (NU) : 0
% 0.34/300.29 # Rec. Clause-clause subsumption calls : 0
% 0.34/300.29 # Non-unit clause-clause subsumptions : 0
% 0.34/300.29 # Unit Clause-clause subsumption calls : 0
% 0.34/300.29 # Rewrite failures with RHS unbound : 0
% 0.34/300.29 # BW rewrite match attempts : 0
% 0.34/300.29 # BW rewrite match successes : 0
% 0.34/300.29 # Condensation attempts : 0
% 0.34/300.29 # Condensation successes : 0
% 0.34/300.29 # Termbank termtop insertions : 177
% 0.34/300.29
% 0.34/300.29 # -------------------------------------------------
% 0.34/300.29 # User time : 0.003 s
% 0.34/300.29 # System time : 0.000 s
% 0.34/300.29 # Total time : 0.004 s
% 0.34/300.29 # Maximum resident set size: 1648 pages
% 0.34/300.29
% 0.34/300.29 # -------------------------------------------------
% 0.34/300.29 # User time : 0.004 s
% 0.34/300.29 # System time : 0.003 s
% 0.34/300.29 # Total time : 0.007 s
% 0.34/300.29 # Maximum resident set size: 1672 pages
% 0.34/300.29 % E---3.1 exiting
% 0.34/300.29 % E---3.1 exiting
%------------------------------------------------------------------------------