TSTP Solution File: SET864-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET864-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:10 EDT 2023
% Result : Unsatisfiable 0.79s 0.71s
% Output : CNFRefutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 8 unt; 0 nHn; 17 RR)
% Number of literals : 31 ( 6 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_4,negated_conjecture,
( c_lessequals(X1,v_x(X1),tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox/tmp/tmp.9hjCbNB6EX/E---3.1_21268.p',cls_conjecture_4) ).
cnf(cls_conjecture_2,negated_conjecture,
c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
file('/export/starexec/sandbox/tmp/tmp.9hjCbNB6EX/E---3.1_21268.p',cls_conjecture_2) ).
cnf(cls_Zorn_Omaxchain__Zorn_0,axiom,
( c_Union(X4,X3) = X1
| ~ c_in(X1,X2,tc_set(X3))
| ~ c_in(X4,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(c_Union(X4,X3),X1,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.9hjCbNB6EX/E---3.1_21268.p',cls_Zorn_Omaxchain__Zorn_0) ).
cnf(cls_conjecture_3,negated_conjecture,
( c_in(v_x(X1),v_S,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox/tmp/tmp.9hjCbNB6EX/E---3.1_21268.p',cls_conjecture_3) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/tmp/tmp.9hjCbNB6EX/E---3.1_21268.p',cls_conjecture_0) ).
cnf(cls_conjecture_5,negated_conjecture,
( X1 != v_x(X1)
| ~ c_in(X1,v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox/tmp/tmp.9hjCbNB6EX/E---3.1_21268.p',cls_conjecture_5) ).
cnf(c_0_6,negated_conjecture,
( c_lessequals(X1,v_x(X1),tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
cls_conjecture_4 ).
cnf(c_0_7,negated_conjecture,
c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
cls_conjecture_2 ).
cnf(c_0_8,axiom,
( c_Union(X4,X3) = X1
| ~ c_in(X1,X2,tc_set(X3))
| ~ c_in(X4,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(c_Union(X4,X3),X1,tc_set(X3)) ),
cls_Zorn_Omaxchain__Zorn_0 ).
cnf(c_0_9,negated_conjecture,
c_lessequals(c_Union(v_c,t_a),v_x(c_Union(v_c,t_a)),tc_set(t_a)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( c_in(v_x(X1),v_S,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
cls_conjecture_3 ).
cnf(c_0_11,negated_conjecture,
( v_x(c_Union(v_c,t_a)) = c_Union(v_c,t_a)
| ~ c_in(v_c,c_Zorn_Omaxchain(X1,t_a),tc_set(tc_set(t_a)))
| ~ c_in(v_x(c_Union(v_c,t_a)),X1,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
cls_conjecture_0 ).
cnf(c_0_13,negated_conjecture,
c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a)),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( X1 != v_x(X1)
| ~ c_in(X1,v_S,tc_set(t_a)) ),
cls_conjecture_5 ).
cnf(c_0_15,negated_conjecture,
v_x(c_Union(v_c,t_a)) = c_Union(v_c,t_a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.20 % Problem : SET864-1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.21 % Command : run_E %s %d THM
% 0.21/0.42 % Computer : n021.cluster.edu
% 0.21/0.42 % Model : x86_64 x86_64
% 0.21/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.42 % Memory : 8042.1875MB
% 0.21/0.42 % OS : Linux 3.10.0-693.el7.x86_64
% 0.21/0.42 % CPULimit : 2400
% 0.21/0.42 % WCLimit : 300
% 0.21/0.42 % DateTime : Mon Oct 2 17:46:59 EDT 2023
% 0.21/0.42 % CPUTime :
% 0.45/0.64 Running first-order theorem proving
% 0.45/0.64 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.9hjCbNB6EX/E---3.1_21268.p
% 0.79/0.71 # Version: 3.1pre001
% 0.79/0.71 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.79/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.79/0.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.79/0.71 # Starting new_bool_3 with 300s (1) cores
% 0.79/0.71 # Starting new_bool_1 with 300s (1) cores
% 0.79/0.71 # Starting sh5l with 300s (1) cores
% 0.79/0.71 # new_bool_1 with pid 21349 completed with status 0
% 0.79/0.71 # Result found by new_bool_1
% 0.79/0.71 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.79/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.79/0.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.79/0.71 # Starting new_bool_3 with 300s (1) cores
% 0.79/0.71 # Starting new_bool_1 with 300s (1) cores
% 0.79/0.71 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.79/0.71 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.79/0.71 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.79/0.71 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 0.79/0.71 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 21352 completed with status 0
% 0.79/0.71 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.79/0.71 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.79/0.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.79/0.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.79/0.71 # Starting new_bool_3 with 300s (1) cores
% 0.79/0.71 # Starting new_bool_1 with 300s (1) cores
% 0.79/0.71 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.79/0.71 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.79/0.71 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.79/0.71 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 0.79/0.71 # Preprocessing time : 0.003 s
% 0.79/0.71 # Presaturation interreduction done
% 0.79/0.71
% 0.79/0.71 # Proof found!
% 0.79/0.71 # SZS status Unsatisfiable
% 0.79/0.71 # SZS output start CNFRefutation
% See solution above
% 0.79/0.71 # Parsed axioms : 1366
% 0.79/0.71 # Removed by relevancy pruning/SinE : 977
% 0.79/0.71 # Initial clauses : 389
% 0.79/0.71 # Removed in clause preprocessing : 0
% 0.79/0.71 # Initial clauses in saturation : 389
% 0.79/0.71 # Processed clauses : 861
% 0.79/0.71 # ...of these trivial : 0
% 0.79/0.71 # ...subsumed : 54
% 0.79/0.71 # ...remaining for further processing : 807
% 0.79/0.71 # Other redundant clauses eliminated : 0
% 0.79/0.71 # Clauses deleted for lack of memory : 0
% 0.79/0.71 # Backward-subsumed : 3
% 0.79/0.71 # Backward-rewritten : 11
% 0.79/0.71 # Generated clauses : 285
% 0.79/0.71 # ...of the previous two non-redundant : 207
% 0.79/0.71 # ...aggressively subsumed : 0
% 0.79/0.71 # Contextual simplify-reflections : 0
% 0.79/0.71 # Paramodulations : 283
% 0.79/0.71 # Factorizations : 0
% 0.79/0.71 # NegExts : 0
% 0.79/0.71 # Equation resolutions : 2
% 0.79/0.71 # Total rewrite steps : 88
% 0.79/0.71 # Propositional unsat checks : 0
% 0.79/0.71 # Propositional check models : 0
% 0.79/0.71 # Propositional check unsatisfiable : 0
% 0.79/0.71 # Propositional clauses : 0
% 0.79/0.71 # Propositional clauses after purity: 0
% 0.79/0.71 # Propositional unsat core size : 0
% 0.79/0.71 # Propositional preprocessing time : 0.000
% 0.79/0.71 # Propositional encoding time : 0.000
% 0.79/0.71 # Propositional solver time : 0.000
% 0.79/0.71 # Success case prop preproc time : 0.000
% 0.79/0.71 # Success case prop encoding time : 0.000
% 0.79/0.71 # Success case prop solver time : 0.000
% 0.79/0.71 # Current number of processed clauses : 411
% 0.79/0.71 # Positive orientable unit clauses : 66
% 0.79/0.71 # Positive unorientable unit clauses: 0
% 0.79/0.71 # Negative unit clauses : 4
% 0.79/0.71 # Non-unit-clauses : 341
% 0.79/0.71 # Current number of unprocessed clauses: 117
% 0.79/0.71 # ...number of literals in the above : 184
% 0.79/0.71 # Current number of archived formulas : 0
% 0.79/0.71 # Current number of archived clauses : 396
% 0.79/0.71 # Clause-clause subsumption calls (NU) : 52291
% 0.79/0.71 # Rec. Clause-clause subsumption calls : 51807
% 0.79/0.71 # Non-unit clause-clause subsumptions : 53
% 0.79/0.71 # Unit Clause-clause subsumption calls : 8
% 0.79/0.71 # Rewrite failures with RHS unbound : 0
% 0.79/0.71 # BW rewrite match attempts : 259
% 0.79/0.71 # BW rewrite match successes : 3
% 0.79/0.71 # Condensation attempts : 0
% 0.79/0.71 # Condensation successes : 0
% 0.79/0.71 # Termbank termtop insertions : 18937
% 0.79/0.71
% 0.79/0.71 # -------------------------------------------------
% 0.79/0.71 # User time : 0.032 s
% 0.79/0.71 # System time : 0.008 s
% 0.79/0.71 # Total time : 0.041 s
% 0.79/0.71 # Maximum resident set size: 2992 pages
% 0.79/0.71
% 0.79/0.71 # -------------------------------------------------
% 0.79/0.71 # User time : 0.053 s
% 0.79/0.71 # System time : 0.010 s
% 0.79/0.71 # Total time : 0.063 s
% 0.79/0.71 # Maximum resident set size: 2404 pages
% 0.79/0.71 % E---3.1 exiting
% 0.79/0.71 % E---3.1 exiting
%------------------------------------------------------------------------------