TSTP Solution File: ALG341-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG341-1 : TPTP v8.2.0. Released v4.1.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 18:13:06 EDT 2024
% Result : Unsatisfiable 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 11 unt; 2 nHn; 22 RR)
% Number of literals : 44 ( 9 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_r,tc_RealDef_Oreal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_real__le__trans_0,axiom,
( c_lessequals(X1,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X3,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X1,X3,tc_RealDef_Oreal) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_real__le__trans_0) ).
cnf(cls_real__le__linear_0,axiom,
( c_lessequals(X1,X2,tc_RealDef_Oreal)
| c_lessequals(X2,X1,tc_RealDef_Oreal) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_real__le__linear_0) ).
cnf(cls_norm__le__zero__iff_0,axiom,
( X2 = c_HOL_Ozero__class_Ozero(X1)
| ~ class_RealVector_Oreal__normed__vector(X1)
| ~ c_lessequals(c_RealVector_Onorm__class_Onorm(X2,X1),c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),tc_RealDef_Oreal) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_norm__le__zero__iff_0) ).
cnf(cls_norm__zero_0,axiom,
( c_RealVector_Onorm__class_Onorm(c_HOL_Ozero__class_Ozero(X1),X1) = c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal)
| ~ class_RealVector_Oreal__normed__vector(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_norm__zero_0) ).
cnf(cls_CHAINED_0_01,axiom,
c_lessequals(c_RealVector_Onorm__class_Onorm(v_z____,tc_Complex_Ocomplex),v_r,tc_RealDef_Oreal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_CHAINED_0_01) ).
cnf(clsarity_Complex__Ocomplex__RealVector_Oreal__normed__vector,axiom,
class_RealVector_Oreal__normed__vector(tc_Complex_Ocomplex),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_Complex__Ocomplex__RealVector_Oreal__normed__vector) ).
cnf(c_0_7,negated_conjecture,
~ c_lessequals(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_r,tc_RealDef_Oreal),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_8,plain,
( c_lessequals(X1,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X3,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X1,X3,tc_RealDef_Oreal) ),
inference(fof_simplification,[status(thm)],[cls_real__le__trans_0]) ).
cnf(c_0_9,negated_conjecture,
~ c_lessequals(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_r,tc_RealDef_Oreal),
c_0_7 ).
cnf(c_0_10,axiom,
( c_lessequals(X1,X2,tc_RealDef_Oreal)
| c_lessequals(X2,X1,tc_RealDef_Oreal) ),
cls_real__le__linear_0 ).
cnf(c_0_11,plain,
( X2 = c_HOL_Ozero__class_Ozero(X1)
| ~ class_RealVector_Oreal__normed__vector(X1)
| ~ c_lessequals(c_RealVector_Onorm__class_Onorm(X2,X1),c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),tc_RealDef_Oreal) ),
inference(fof_simplification,[status(thm)],[cls_norm__le__zero__iff_0]) ).
cnf(c_0_12,plain,
( c_lessequals(X1,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X3,X2,tc_RealDef_Oreal)
| ~ c_lessequals(X1,X3,tc_RealDef_Oreal) ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
c_lessequals(v_r,c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),tc_RealDef_Oreal),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( X2 = c_HOL_Ozero__class_Ozero(X1)
| ~ class_RealVector_Oreal__normed__vector(X1)
| ~ c_lessequals(c_RealVector_Onorm__class_Onorm(X2,X1),c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),tc_RealDef_Oreal) ),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
( c_lessequals(X1,c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),tc_RealDef_Oreal)
| ~ c_lessequals(X1,v_r,tc_RealDef_Oreal) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( c_RealVector_Onorm__class_Onorm(c_HOL_Ozero__class_Ozero(X1),X1) = c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal)
| ~ class_RealVector_Oreal__normed__vector(X1) ),
inference(fof_simplification,[status(thm)],[cls_norm__zero_0]) ).
cnf(c_0_17,negated_conjecture,
( X1 = c_HOL_Ozero__class_Ozero(X2)
| ~ c_lessequals(c_RealVector_Onorm__class_Onorm(X1,X2),v_r,tc_RealDef_Oreal)
| ~ class_RealVector_Oreal__normed__vector(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
c_lessequals(c_RealVector_Onorm__class_Onorm(v_z____,tc_Complex_Ocomplex),v_r,tc_RealDef_Oreal),
cls_CHAINED_0_01 ).
cnf(c_0_19,axiom,
class_RealVector_Oreal__normed__vector(tc_Complex_Ocomplex),
clsarity_Complex__Ocomplex__RealVector_Oreal__normed__vector ).
cnf(c_0_20,plain,
( c_RealVector_Onorm__class_Onorm(c_HOL_Ozero__class_Ozero(X1),X1) = c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal)
| ~ class_RealVector_Oreal__normed__vector(X1) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex) = v_z____,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
c_RealVector_Onorm__class_Onorm(v_z____,tc_Complex_Ocomplex) = c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_19])]) ).
cnf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_22]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : ALG341-1 : TPTP v8.2.0. Released v4.1.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n025.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sat May 18 23:06:52 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.47 # Version: 3.1.0
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # new_bool_1 with pid 10846 completed with status 0
% 0.16/0.47 # Result found by new_bool_1
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.47 # Search class: FGUSF-FFLM32-MFFFFFNN
% 0.16/0.47 # partial match(1): FGUSF-FFMM32-MFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.47 # SAT001_MinMin_p005000_rr_RG with pid 10848 completed with status 0
% 0.16/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.47 # Search class: FGUSF-FFLM32-MFFFFFNN
% 0.16/0.47 # partial match(1): FGUSF-FFMM32-MFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.47 # Preprocessing time : 0.003 s
% 0.16/0.47 # Presaturation interreduction done
% 0.16/0.47
% 0.16/0.47 # Proof found!
% 0.16/0.47 # SZS status Unsatisfiable
% 0.16/0.47 # SZS output start CNFRefutation
% See solution above
% 0.16/0.47 # Parsed axioms : 595
% 0.16/0.47 # Removed by relevancy pruning/SinE : 431
% 0.16/0.47 # Initial clauses : 164
% 0.16/0.47 # Removed in clause preprocessing : 0
% 0.16/0.47 # Initial clauses in saturation : 164
% 0.16/0.47 # Processed clauses : 264
% 0.16/0.47 # ...of these trivial : 4
% 0.16/0.47 # ...subsumed : 42
% 0.16/0.47 # ...remaining for further processing : 218
% 0.16/0.47 # Other redundant clauses eliminated : 12
% 0.16/0.47 # Clauses deleted for lack of memory : 0
% 0.16/0.47 # Backward-subsumed : 0
% 0.16/0.47 # Backward-rewritten : 8
% 0.16/0.47 # Generated clauses : 184
% 0.16/0.47 # ...of the previous two non-redundant : 118
% 0.16/0.47 # ...aggressively subsumed : 0
% 0.16/0.47 # Contextual simplify-reflections : 0
% 0.16/0.47 # Paramodulations : 169
% 0.16/0.47 # Factorizations : 2
% 0.16/0.47 # NegExts : 0
% 0.16/0.47 # Equation resolutions : 13
% 0.16/0.47 # Disequality decompositions : 0
% 0.16/0.47 # Total rewrite steps : 114
% 0.16/0.47 # ...of those cached : 93
% 0.16/0.47 # Propositional unsat checks : 0
% 0.16/0.47 # Propositional check models : 0
% 0.16/0.47 # Propositional check unsatisfiable : 0
% 0.16/0.47 # Propositional clauses : 0
% 0.16/0.47 # Propositional clauses after purity: 0
% 0.16/0.47 # Propositional unsat core size : 0
% 0.16/0.47 # Propositional preprocessing time : 0.000
% 0.16/0.47 # Propositional encoding time : 0.000
% 0.16/0.47 # Propositional solver time : 0.000
% 0.16/0.47 # Success case prop preproc time : 0.000
% 0.16/0.47 # Success case prop encoding time : 0.000
% 0.16/0.47 # Success case prop solver time : 0.000
% 0.16/0.47 # Current number of processed clauses : 83
% 0.16/0.47 # Positive orientable unit clauses : 34
% 0.16/0.47 # Positive unorientable unit clauses: 0
% 0.16/0.47 # Negative unit clauses : 1
% 0.16/0.47 # Non-unit-clauses : 48
% 0.16/0.47 # Current number of unprocessed clauses: 144
% 0.16/0.47 # ...number of literals in the above : 339
% 0.16/0.47 # Current number of archived formulas : 0
% 0.16/0.47 # Current number of archived clauses : 135
% 0.16/0.47 # Clause-clause subsumption calls (NU) : 786
% 0.16/0.47 # Rec. Clause-clause subsumption calls : 693
% 0.16/0.47 # Non-unit clause-clause subsumptions : 41
% 0.16/0.47 # Unit Clause-clause subsumption calls : 88
% 0.16/0.47 # Rewrite failures with RHS unbound : 0
% 0.16/0.47 # BW rewrite match attempts : 22
% 0.16/0.47 # BW rewrite match successes : 2
% 0.16/0.47 # Condensation attempts : 0
% 0.16/0.47 # Condensation successes : 0
% 0.16/0.47 # Termbank termtop insertions : 11453
% 0.16/0.47 # Search garbage collected termcells : 1601
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.017 s
% 0.16/0.47 # System time : 0.004 s
% 0.16/0.47 # Total time : 0.021 s
% 0.16/0.47 # Maximum resident set size: 2380 pages
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.029 s
% 0.16/0.47 # System time : 0.007 s
% 0.16/0.47 # Total time : 0.037 s
% 0.16/0.47 # Maximum resident set size: 2092 pages
% 0.16/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------