TSTP Solution File: SWV580-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV580-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:54:56 EDT 2023
% Result : Unsatisfiable 0.42s 0.70s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 22 unt; 0 nHn; 18 RR)
% Number of literals : 35 ( 20 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-4 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_calculation_0,axiom,
( c_HOL_Oplus__class_Oplus(hAPP(v_f,v_m),c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_nat,t_a),t_a) = c_Finite__Set_Osetsum(v_f,c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(v_m,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_fun(tc_nat,tc_bool)),tc_nat,t_a)
| ~ class_OrderedGroup_Ocomm__monoid__add(t_a) ),
file('/export/starexec/sandbox/tmp/tmp.pZVtk2QEIP/E---3.1_14231.p',cls_calculation_0) ).
cnf(tfree_tcs,negated_conjecture,
class_OrderedGroup_Ocomm__monoid__add(t_a),
file('/export/starexec/sandbox/tmp/tmp.pZVtk2QEIP/E---3.1_14231.p',tfree_tcs) ).
cnf(cls_conjecture_0,negated_conjecture,
c_Finite__Set_Osetsum(v_f,c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(v_m,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_fun(tc_nat,tc_bool)),tc_nat,t_a) != c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OatLeastLessThan(v_m,v_n,tc_nat),tc_nat,t_a),
file('/export/starexec/sandbox/tmp/tmp.pZVtk2QEIP/E---3.1_14231.p',cls_conjecture_0) ).
cnf(cls_insert__is__Un_0,axiom,
c_Set_Oinsert(X1,X2,X3) = c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X1,c_Orderings_Obot__class_Obot(tc_fun(X3,tc_bool)),X3),X2,tc_fun(X3,tc_bool)),
file('/export/starexec/sandbox/tmp/tmp.pZVtk2QEIP/E---3.1_14231.p',cls_insert__is__Un_0) ).
cnf(cls_Un__insert__left_0,axiom,
c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool)) = c_Set_Oinsert(X1,c_Lattices_Oupper__semilattice__class_Osup(X2,X4,tc_fun(X3,tc_bool)),X3),
file('/export/starexec/sandbox/tmp/tmp.pZVtk2QEIP/E---3.1_14231.p',cls_Un__insert__left_0) ).
cnf(cls_Un__insert__right_0,axiom,
c_Lattices_Oupper__semilattice__class_Osup(X1,c_Set_Oinsert(X2,X3,X4),tc_fun(X4,tc_bool)) = c_Set_Oinsert(X2,c_Lattices_Oupper__semilattice__class_Osup(X1,X3,tc_fun(X4,tc_bool)),X4),
file('/export/starexec/sandbox/tmp/tmp.pZVtk2QEIP/E---3.1_14231.p',cls_Un__insert__right_0) ).
cnf(cls_ivl__disj__un_I3_J_0,axiom,
( c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X2,c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X1),c_SetInterval_Oord__class_OgreaterThanLessThan(X2,X3,X1),tc_fun(X1,tc_bool)) = c_SetInterval_Oord__class_OatLeastLessThan(X2,X3,X1)
| ~ class_Orderings_Olinorder(X1)
| ~ c_HOL_Oord__class_Oless(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.pZVtk2QEIP/E---3.1_14231.p',cls_ivl__disj__un_I3_J_0) ).
cnf(cls_Un__empty__left_0,axiom,
c_Lattices_Oupper__semilattice__class_Osup(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2,tc_fun(X1,tc_bool)) = X2,
file('/export/starexec/sandbox/tmp/tmp.pZVtk2QEIP/E---3.1_14231.p',cls_Un__empty__left_0) ).
cnf(clsarity_nat__Orderings_Olinorder,axiom,
class_Orderings_Olinorder(tc_nat),
file('/export/starexec/sandbox/tmp/tmp.pZVtk2QEIP/E---3.1_14231.p',clsarity_nat__Orderings_Olinorder) ).
cnf(cls_less_0,axiom,
c_HOL_Oord__class_Oless(v_m,v_n,tc_nat),
file('/export/starexec/sandbox/tmp/tmp.pZVtk2QEIP/E---3.1_14231.p',cls_less_0) ).
cnf(c_0_10,axiom,
( c_HOL_Oplus__class_Oplus(hAPP(v_f,v_m),c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_nat,t_a),t_a) = c_Finite__Set_Osetsum(v_f,c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(v_m,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_fun(tc_nat,tc_bool)),tc_nat,t_a)
| ~ class_OrderedGroup_Ocomm__monoid__add(t_a) ),
cls_calculation_0 ).
cnf(c_0_11,negated_conjecture,
class_OrderedGroup_Ocomm__monoid__add(t_a),
tfree_tcs ).
cnf(c_0_12,negated_conjecture,
c_Finite__Set_Osetsum(v_f,c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(v_m,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_fun(tc_nat,tc_bool)),tc_nat,t_a) != c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OatLeastLessThan(v_m,v_n,tc_nat),tc_nat,t_a),
cls_conjecture_0 ).
cnf(c_0_13,plain,
c_Finite__Set_Osetsum(v_f,c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(v_m,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_fun(tc_nat,tc_bool)),tc_nat,t_a) = c_HOL_Oplus__class_Oplus(hAPP(v_f,v_m),c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_nat,t_a),t_a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_14,axiom,
c_Set_Oinsert(X1,X2,X3) = c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X1,c_Orderings_Obot__class_Obot(tc_fun(X3,tc_bool)),X3),X2,tc_fun(X3,tc_bool)),
cls_insert__is__Un_0 ).
cnf(c_0_15,axiom,
c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool)) = c_Set_Oinsert(X1,c_Lattices_Oupper__semilattice__class_Osup(X2,X4,tc_fun(X3,tc_bool)),X3),
cls_Un__insert__left_0 ).
cnf(c_0_16,axiom,
c_Lattices_Oupper__semilattice__class_Osup(X1,c_Set_Oinsert(X2,X3,X4),tc_fun(X4,tc_bool)) = c_Set_Oinsert(X2,c_Lattices_Oupper__semilattice__class_Osup(X1,X3,tc_fun(X4,tc_bool)),X4),
cls_Un__insert__right_0 ).
cnf(c_0_17,negated_conjecture,
c_HOL_Oplus__class_Oplus(hAPP(v_f,v_m),c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_nat,t_a),t_a) != c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OatLeastLessThan(v_m,v_n,tc_nat),tc_nat,t_a),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
c_HOL_Oplus__class_Oplus(hAPP(v_f,v_m),c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_nat,t_a),t_a) = c_Finite__Set_Osetsum(v_f,c_Set_Oinsert(v_m,c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_nat),tc_nat,t_a),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,axiom,
( c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X2,c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X1),c_SetInterval_Oord__class_OgreaterThanLessThan(X2,X3,X1),tc_fun(X1,tc_bool)) = c_SetInterval_Oord__class_OatLeastLessThan(X2,X3,X1)
| ~ class_Orderings_Olinorder(X1)
| ~ c_HOL_Oord__class_Oless(X2,X3,X1) ),
cls_ivl__disj__un_I3_J_0 ).
cnf(c_0_20,plain,
c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool)) = c_Lattices_Oupper__semilattice__class_Osup(X2,c_Set_Oinsert(X1,X4,X3),tc_fun(X3,tc_bool)),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,axiom,
c_Lattices_Oupper__semilattice__class_Osup(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2,tc_fun(X1,tc_bool)) = X2,
cls_Un__empty__left_0 ).
cnf(c_0_22,negated_conjecture,
c_Finite__Set_Osetsum(v_f,c_Set_Oinsert(v_m,c_SetInterval_Oord__class_OgreaterThanLessThan(v_m,v_n,tc_nat),tc_nat),tc_nat,t_a) != c_Finite__Set_Osetsum(v_f,c_SetInterval_Oord__class_OatLeastLessThan(v_m,v_n,tc_nat),tc_nat,t_a),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( c_Set_Oinsert(X1,c_SetInterval_Oord__class_OgreaterThanLessThan(X1,X2,X3),X3) = c_SetInterval_Oord__class_OatLeastLessThan(X1,X2,X3)
| ~ class_Orderings_Olinorder(X3)
| ~ c_HOL_Oord__class_Oless(X1,X2,X3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,axiom,
class_Orderings_Olinorder(tc_nat),
clsarity_nat__Orderings_Olinorder ).
cnf(c_0_25,axiom,
c_HOL_Oord__class_Oless(v_m,v_n,tc_nat),
cls_less_0 ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.17 % Problem : SWV580-1 : TPTP v8.1.2. Released v4.1.0.
% 0.17/0.18 % Command : run_E %s %d THM
% 0.19/0.39 % Computer : n028.cluster.edu
% 0.19/0.39 % Model : x86_64 x86_64
% 0.19/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.39 % Memory : 8042.1875MB
% 0.19/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.39 % CPULimit : 2400
% 0.19/0.39 % WCLimit : 300
% 0.19/0.39 % DateTime : Tue Oct 3 04:13:07 EDT 2023
% 0.19/0.39 % CPUTime :
% 0.36/0.57 Running first-order theorem proving
% 0.36/0.57 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.pZVtk2QEIP/E---3.1_14231.p
% 0.42/0.70 # Version: 3.1pre001
% 0.42/0.70 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.42/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.70 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.42/0.70 # Starting new_bool_3 with 300s (1) cores
% 0.42/0.70 # Starting new_bool_1 with 300s (1) cores
% 0.42/0.70 # Starting sh5l with 300s (1) cores
% 0.42/0.70 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 14310 completed with status 0
% 0.42/0.70 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.42/0.70 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.42/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.70 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.42/0.70 # No SInE strategy applied
% 0.42/0.70 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.42/0.70 # Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.42/0.70 # Starting G-E--_303_C18_F1_URBAN_S0Y with 123s (1) cores
% 0.42/0.70 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.42/0.70 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.42/0.70 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 0.42/0.70 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0i with 123s (1) cores
% 0.42/0.70 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 14320 completed with status 0
% 0.42/0.70 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 0.42/0.70 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.42/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.70 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.42/0.70 # No SInE strategy applied
% 0.42/0.70 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.42/0.70 # Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.42/0.70 # Starting G-E--_303_C18_F1_URBAN_S0Y with 123s (1) cores
% 0.42/0.70 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.42/0.70 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.42/0.70 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 0.42/0.70 # Preprocessing time : 0.009 s
% 0.42/0.70 # Presaturation interreduction done
% 0.42/0.70
% 0.42/0.70 # Proof found!
% 0.42/0.70 # SZS status Unsatisfiable
% 0.42/0.70 # SZS output start CNFRefutation
% See solution above
% 0.42/0.70 # Parsed axioms : 601
% 0.42/0.70 # Removed by relevancy pruning/SinE : 0
% 0.42/0.70 # Initial clauses : 601
% 0.42/0.70 # Removed in clause preprocessing : 3
% 0.42/0.70 # Initial clauses in saturation : 598
% 0.42/0.70 # Processed clauses : 907
% 0.42/0.70 # ...of these trivial : 14
% 0.42/0.70 # ...subsumed : 90
% 0.42/0.70 # ...remaining for further processing : 803
% 0.42/0.70 # Other redundant clauses eliminated : 29
% 0.42/0.70 # Clauses deleted for lack of memory : 0
% 0.42/0.70 # Backward-subsumed : 2
% 0.42/0.70 # Backward-rewritten : 6
% 0.42/0.70 # Generated clauses : 1387
% 0.42/0.70 # ...of the previous two non-redundant : 1022
% 0.42/0.70 # ...aggressively subsumed : 0
% 0.42/0.70 # Contextual simplify-reflections : 0
% 0.42/0.70 # Paramodulations : 1354
% 0.42/0.70 # Factorizations : 2
% 0.42/0.70 # NegExts : 0
% 0.42/0.70 # Equation resolutions : 31
% 0.42/0.70 # Total rewrite steps : 508
% 0.42/0.70 # Propositional unsat checks : 0
% 0.42/0.70 # Propositional check models : 0
% 0.42/0.70 # Propositional check unsatisfiable : 0
% 0.42/0.70 # Propositional clauses : 0
% 0.42/0.70 # Propositional clauses after purity: 0
% 0.42/0.70 # Propositional unsat core size : 0
% 0.42/0.70 # Propositional preprocessing time : 0.000
% 0.42/0.70 # Propositional encoding time : 0.000
% 0.42/0.70 # Propositional solver time : 0.000
% 0.42/0.70 # Success case prop preproc time : 0.000
% 0.42/0.70 # Success case prop encoding time : 0.000
% 0.42/0.70 # Success case prop solver time : 0.000
% 0.42/0.70 # Current number of processed clauses : 302
% 0.42/0.70 # Positive orientable unit clauses : 81
% 0.42/0.70 # Positive unorientable unit clauses: 3
% 0.42/0.70 # Negative unit clauses : 9
% 0.42/0.70 # Non-unit-clauses : 209
% 0.42/0.70 # Current number of unprocessed clauses: 1204
% 0.42/0.70 # ...number of literals in the above : 2810
% 0.42/0.70 # Current number of archived formulas : 0
% 0.42/0.70 # Current number of archived clauses : 502
% 0.42/0.70 # Clause-clause subsumption calls (NU) : 24195
% 0.42/0.70 # Rec. Clause-clause subsumption calls : 18591
% 0.42/0.70 # Non-unit clause-clause subsumptions : 75
% 0.42/0.70 # Unit Clause-clause subsumption calls : 40
% 0.42/0.70 # Rewrite failures with RHS unbound : 0
% 0.42/0.70 # BW rewrite match attempts : 178
% 0.42/0.70 # BW rewrite match successes : 71
% 0.42/0.70 # Condensation attempts : 0
% 0.42/0.70 # Condensation successes : 0
% 0.42/0.70 # Termbank termtop insertions : 36941
% 0.42/0.70
% 0.42/0.70 # -------------------------------------------------
% 0.42/0.70 # User time : 0.094 s
% 0.42/0.70 # System time : 0.011 s
% 0.42/0.70 # Total time : 0.105 s
% 0.42/0.70 # Maximum resident set size: 2784 pages
% 0.42/0.70
% 0.42/0.70 # -------------------------------------------------
% 0.42/0.70 # User time : 0.460 s
% 0.42/0.70 # System time : 0.041 s
% 0.42/0.70 # Total time : 0.502 s
% 0.42/0.70 # Maximum resident set size: 2100 pages
% 0.42/0.70 % E---3.1 exiting
% 0.42/0.70 % E---3.1 exiting
%------------------------------------------------------------------------------