TSTP Solution File: SWV885-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV885-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:55:34 EDT 2023
% Result : Unsatisfiable 0.42s 0.87s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of clauses : 29 ( 22 unt; 2 nHn; 21 RR)
% Number of literals : 40 ( 17 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 9 con; 0-4 aty)
% Number of variables : 34 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_finite__surj_0,axiom,
( c_Finite__Set_Ofinite(X1,X2)
| ~ c_lessequals(X1,c_Set_Oimage(X3,X4,X5,X2),tc_fun(X2,tc_bool))
| ~ c_Finite__Set_Ofinite(X4,X5) ),
file('/export/starexec/sandbox/tmp/tmp.LP6CdwC05x/E---3.1_7054.p',cls_finite__surj_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_lessequals(v_G,c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool)),
file('/export/starexec/sandbox/tmp/tmp.LP6CdwC05x/E---3.1_7054.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_Finite__Set_Ofinite(v_U,tc_Com_Opname),
file('/export/starexec/sandbox/tmp/tmp.LP6CdwC05x/E---3.1_7054.p',cls_conjecture_0) ).
cnf(cls_le__imp__diff__is__add_0,axiom,
( X2 = c_HOL_Oplus__class_Oplus(c_HOL_Ominus__class_Ominus(X2,X1,tc_nat),X1,tc_nat)
| ~ c_lessequals(X1,X2,tc_nat) ),
file('/export/starexec/sandbox/tmp/tmp.LP6CdwC05x/E---3.1_7054.p',cls_le__imp__diff__is__add_0) ).
cnf(cls_nat__add__commute_0,axiom,
c_HOL_Oplus__class_Oplus(X1,X2,tc_nat) = c_HOL_Oplus__class_Oplus(X2,X1,tc_nat),
file('/export/starexec/sandbox/tmp/tmp.LP6CdwC05x/E---3.1_7054.p',cls_nat__add__commute_0) ).
cnf(cls_conjecture_6,negated_conjecture,
c_Finite__Set_Ocard(c_Set_Oinsert(hAPP(v_mgt__call,v_pn),v_G,t_a),t_a) != c_HOL_Ominus__class_Ominus(c_Finite__Set_Ocard(c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a),v_na,tc_nat),
file('/export/starexec/sandbox/tmp/tmp.LP6CdwC05x/E---3.1_7054.p',cls_conjecture_6) ).
cnf(cls_card__insert__if_1,axiom,
( c_Finite__Set_Ocard(c_Set_Oinsert(X1,X2,X3),X3) = c_Suc(c_Finite__Set_Ocard(X2,X3))
| c_in(X1,X2,X3)
| ~ c_Finite__Set_Ofinite(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.LP6CdwC05x/E---3.1_7054.p',cls_card__insert__if_1) ).
cnf(cls_conjecture_5,negated_conjecture,
~ c_in(hAPP(v_mgt__call,v_pn),v_G,t_a),
file('/export/starexec/sandbox/tmp/tmp.LP6CdwC05x/E---3.1_7054.p',cls_conjecture_5) ).
cnf(cls_conjecture_3,negated_conjecture,
c_Finite__Set_Ocard(v_G,t_a) = c_HOL_Ominus__class_Ominus(c_Finite__Set_Ocard(c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a),c_Suc(v_na),tc_nat),
file('/export/starexec/sandbox/tmp/tmp.LP6CdwC05x/E---3.1_7054.p',cls_conjecture_3) ).
cnf(cls_add__Suc__shift_0,axiom,
c_HOL_Oplus__class_Oplus(c_Suc(X1),X2,tc_nat) = c_HOL_Oplus__class_Oplus(X1,c_Suc(X2),tc_nat),
file('/export/starexec/sandbox/tmp/tmp.LP6CdwC05x/E---3.1_7054.p',cls_add__Suc__shift_0) ).
cnf(cls_conjecture_2,negated_conjecture,
c_lessequals(c_Suc(v_na),c_Finite__Set_Ocard(c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a),tc_nat),
file('/export/starexec/sandbox/tmp/tmp.LP6CdwC05x/E---3.1_7054.p',cls_conjecture_2) ).
cnf(cls_diff__add__inverse_0,axiom,
c_HOL_Ominus__class_Ominus(c_HOL_Oplus__class_Oplus(X1,X2,tc_nat),X1,tc_nat) = X2,
file('/export/starexec/sandbox/tmp/tmp.LP6CdwC05x/E---3.1_7054.p',cls_diff__add__inverse_0) ).
cnf(c_0_12,axiom,
( c_Finite__Set_Ofinite(X1,X2)
| ~ c_lessequals(X1,c_Set_Oimage(X3,X4,X5,X2),tc_fun(X2,tc_bool))
| ~ c_Finite__Set_Ofinite(X4,X5) ),
cls_finite__surj_0 ).
cnf(c_0_13,negated_conjecture,
c_lessequals(v_G,c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),tc_fun(t_a,tc_bool)),
cls_conjecture_1 ).
cnf(c_0_14,negated_conjecture,
c_Finite__Set_Ofinite(v_U,tc_Com_Opname),
cls_conjecture_0 ).
cnf(c_0_15,axiom,
( X2 = c_HOL_Oplus__class_Oplus(c_HOL_Ominus__class_Ominus(X2,X1,tc_nat),X1,tc_nat)
| ~ c_lessequals(X1,X2,tc_nat) ),
cls_le__imp__diff__is__add_0 ).
cnf(c_0_16,axiom,
c_HOL_Oplus__class_Oplus(X1,X2,tc_nat) = c_HOL_Oplus__class_Oplus(X2,X1,tc_nat),
cls_nat__add__commute_0 ).
cnf(c_0_17,negated_conjecture,
c_Finite__Set_Ocard(c_Set_Oinsert(hAPP(v_mgt__call,v_pn),v_G,t_a),t_a) != c_HOL_Ominus__class_Ominus(c_Finite__Set_Ocard(c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a),v_na,tc_nat),
cls_conjecture_6 ).
cnf(c_0_18,axiom,
( c_Finite__Set_Ocard(c_Set_Oinsert(X1,X2,X3),X3) = c_Suc(c_Finite__Set_Ocard(X2,X3))
| c_in(X1,X2,X3)
| ~ c_Finite__Set_Ofinite(X2,X3) ),
cls_card__insert__if_1 ).
cnf(c_0_19,negated_conjecture,
~ c_in(hAPP(v_mgt__call,v_pn),v_G,t_a),
cls_conjecture_5 ).
cnf(c_0_20,negated_conjecture,
c_Finite__Set_Ofinite(v_G,t_a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_21,plain,
( c_HOL_Oplus__class_Oplus(X1,c_HOL_Ominus__class_Ominus(X2,X1,tc_nat),tc_nat) = X2
| ~ c_lessequals(X1,X2,tc_nat) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
c_Finite__Set_Ocard(v_G,t_a) = c_HOL_Ominus__class_Ominus(c_Finite__Set_Ocard(c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a),c_Suc(v_na),tc_nat),
cls_conjecture_3 ).
cnf(c_0_23,axiom,
c_HOL_Oplus__class_Oplus(c_Suc(X1),X2,tc_nat) = c_HOL_Oplus__class_Oplus(X1,c_Suc(X2),tc_nat),
cls_add__Suc__shift_0 ).
cnf(c_0_24,negated_conjecture,
c_lessequals(c_Suc(v_na),c_Finite__Set_Ocard(c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a),tc_nat),
cls_conjecture_2 ).
cnf(c_0_25,negated_conjecture,
c_HOL_Ominus__class_Ominus(c_Finite__Set_Ocard(c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a),v_na,tc_nat) != c_Suc(c_Finite__Set_Ocard(v_G,t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_26,negated_conjecture,
c_Finite__Set_Ocard(c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),t_a) = c_HOL_Oplus__class_Oplus(v_na,c_Suc(c_Finite__Set_Ocard(v_G,t_a)),tc_nat),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_27,axiom,
c_HOL_Ominus__class_Ominus(c_HOL_Oplus__class_Oplus(X1,X2,tc_nat),X1,tc_nat) = X2,
cls_diff__add__inverse_0 ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.19 % Problem : SWV885-1 : TPTP v8.1.2. Released v4.1.0.
% 0.09/0.20 % Command : run_E %s %d THM
% 0.18/0.40 % Computer : n010.cluster.edu
% 0.18/0.40 % Model : x86_64 x86_64
% 0.18/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.40 % Memory : 8042.1875MB
% 0.18/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.40 % CPULimit : 2400
% 0.18/0.40 % WCLimit : 300
% 0.18/0.40 % DateTime : Tue Oct 3 03:05:05 EDT 2023
% 0.18/0.40 % CPUTime :
% 0.38/0.59 Running first-order theorem proving
% 0.38/0.59 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.LP6CdwC05x/E---3.1_7054.p
% 0.42/0.87 # Version: 3.1pre001
% 0.42/0.87 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.42/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/0.87 # Starting new_bool_3 with 300s (1) cores
% 0.42/0.87 # Starting new_bool_1 with 300s (1) cores
% 0.42/0.87 # Starting sh5l with 300s (1) cores
% 0.42/0.87 # new_bool_3 with pid 7133 completed with status 0
% 0.42/0.87 # Result found by new_bool_3
% 0.42/0.87 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.42/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/0.87 # Starting new_bool_3 with 300s (1) cores
% 0.42/0.87 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.42/0.87 # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.42/0.87 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.42/0.87 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 0.42/0.87 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 7137 completed with status 0
% 0.42/0.87 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 0.42/0.87 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.42/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/0.87 # Starting new_bool_3 with 300s (1) cores
% 0.42/0.87 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.42/0.87 # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.42/0.87 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.42/0.87 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 0.42/0.87 # Preprocessing time : 0.020 s
% 0.42/0.87
% 0.42/0.87 # Proof found!
% 0.42/0.87 # SZS status Unsatisfiable
% 0.42/0.87 # SZS output start CNFRefutation
% See solution above
% 0.42/0.87 # Parsed axioms : 1121
% 0.42/0.87 # Removed by relevancy pruning/SinE : 505
% 0.42/0.87 # Initial clauses : 616
% 0.42/0.87 # Removed in clause preprocessing : 0
% 0.42/0.87 # Initial clauses in saturation : 616
% 0.42/0.87 # Processed clauses : 747
% 0.42/0.87 # ...of these trivial : 45
% 0.42/0.87 # ...subsumed : 180
% 0.42/0.87 # ...remaining for further processing : 522
% 0.42/0.87 # Other redundant clauses eliminated : 5
% 0.42/0.87 # Clauses deleted for lack of memory : 0
% 0.42/0.87 # Backward-subsumed : 7
% 0.42/0.87 # Backward-rewritten : 33
% 0.42/0.87 # Generated clauses : 9614
% 0.42/0.87 # ...of the previous two non-redundant : 8108
% 0.42/0.87 # ...aggressively subsumed : 0
% 0.42/0.87 # Contextual simplify-reflections : 4
% 0.42/0.87 # Paramodulations : 9589
% 0.42/0.87 # Factorizations : 4
% 0.42/0.87 # NegExts : 0
% 0.42/0.87 # Equation resolutions : 21
% 0.42/0.87 # Total rewrite steps : 7793
% 0.42/0.87 # Propositional unsat checks : 0
% 0.42/0.87 # Propositional check models : 0
% 0.42/0.87 # Propositional check unsatisfiable : 0
% 0.42/0.87 # Propositional clauses : 0
% 0.42/0.87 # Propositional clauses after purity: 0
% 0.42/0.87 # Propositional unsat core size : 0
% 0.42/0.87 # Propositional preprocessing time : 0.000
% 0.42/0.87 # Propositional encoding time : 0.000
% 0.42/0.87 # Propositional solver time : 0.000
% 0.42/0.87 # Success case prop preproc time : 0.000
% 0.42/0.87 # Success case prop encoding time : 0.000
% 0.42/0.87 # Success case prop solver time : 0.000
% 0.42/0.87 # Current number of processed clauses : 482
% 0.42/0.87 # Positive orientable unit clauses : 104
% 0.42/0.87 # Positive unorientable unit clauses: 10
% 0.42/0.87 # Negative unit clauses : 17
% 0.42/0.87 # Non-unit-clauses : 351
% 0.42/0.87 # Current number of unprocessed clauses: 7964
% 0.42/0.87 # ...number of literals in the above : 20149
% 0.42/0.87 # Current number of archived formulas : 0
% 0.42/0.87 # Current number of archived clauses : 40
% 0.42/0.87 # Clause-clause subsumption calls (NU) : 18593
% 0.42/0.87 # Rec. Clause-clause subsumption calls : 16805
% 0.42/0.87 # Non-unit clause-clause subsumptions : 134
% 0.42/0.87 # Unit Clause-clause subsumption calls : 1129
% 0.42/0.87 # Rewrite failures with RHS unbound : 15
% 0.42/0.87 # BW rewrite match attempts : 144
% 0.42/0.87 # BW rewrite match successes : 78
% 0.42/0.87 # Condensation attempts : 0
% 0.42/0.87 # Condensation successes : 0
% 0.42/0.87 # Termbank termtop insertions : 181345
% 0.42/0.87
% 0.42/0.87 # -------------------------------------------------
% 0.42/0.87 # User time : 0.225 s
% 0.42/0.87 # System time : 0.016 s
% 0.42/0.87 # Total time : 0.241 s
% 0.42/0.87 # Maximum resident set size: 3244 pages
% 0.42/0.87
% 0.42/0.87 # -------------------------------------------------
% 0.42/0.87 # User time : 0.252 s
% 0.42/0.87 # System time : 0.019 s
% 0.42/0.87 # Total time : 0.272 s
% 0.42/0.87 # Maximum resident set size: 2468 pages
% 0.42/0.87 % E---3.1 exiting
% 0.42/0.87 % E---3.1 exiting
%------------------------------------------------------------------------------