TSTP Solution File: ALG386-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG386-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : Sat May 4 07:23:48 EDT 2024
% Result : Unsatisfiable 0.38s 0.63s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 15 ( 7 unt; 2 nHn; 12 RR)
% Number of literals : 23 ( 0 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 11 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_2,negated_conjecture,
( v_thesis____
| ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_x(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
file('/export/starexec/sandbox/tmp/tmp.qqupPahBry/E---3.1_25371.p',cls_conjecture_2) ).
cnf(cls_conjecture_0,negated_conjecture,
~ v_thesis____,
file('/export/starexec/sandbox/tmp/tmp.qqupPahBry/E---3.1_25371.p',cls_conjecture_0) ).
cnf(cls_CHAINED_0,axiom,
( c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(v_sko__CHAINED__1(v_c____,v_cs____),c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
file('/export/starexec/sandbox/tmp/tmp.qqupPahBry/E---3.1_25371.p',cls_CHAINED_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( v_thesis____
| c_lessequals(X1,c_RealVector_Onorm__class_Onorm(v_x(X1),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
file('/export/starexec/sandbox/tmp/tmp.qqupPahBry/E---3.1_25371.p',cls_conjecture_1) ).
cnf(c_0_4,negated_conjecture,
( v_thesis____
| ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_x(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_5,negated_conjecture,
~ v_thesis____,
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_6,negated_conjecture,
( v_thesis____
| ~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_x(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
c_0_4 ).
cnf(c_0_7,negated_conjecture,
~ v_thesis____,
c_0_5 ).
cnf(c_0_8,plain,
( c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(v_sko__CHAINED__1(v_c____,v_cs____),c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
inference(fof_simplification,[status(thm)],[cls_CHAINED_0]) ).
cnf(c_0_9,negated_conjecture,
~ c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),v_x(X1),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(sr,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( c_lessequals(c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),c_RealVector_Onorm__class_Onorm(c_Polynomial_Opoly(c_Polynomial_OpCons(v_c____,v_cs____,tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_RealDef_Oreal)
| ~ c_lessequals(v_sko__CHAINED__1(v_c____,v_cs____),c_RealVector_Onorm__class_Onorm(X1,tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
c_0_8 ).
cnf(c_0_11,negated_conjecture,
( v_thesis____
| c_lessequals(X1,c_RealVector_Onorm__class_Onorm(v_x(X1),tc_Complex_Ocomplex),tc_RealDef_Oreal) ),
cls_conjecture_1 ).
cnf(c_0_12,negated_conjecture,
~ c_lessequals(v_sko__CHAINED__1(v_c____,v_cs____),c_RealVector_Onorm__class_Onorm(v_x(X1),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
c_lessequals(X1,c_RealVector_Onorm__class_Onorm(v_x(X1),tc_Complex_Ocomplex),tc_RealDef_Oreal),
inference(sr,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_12,c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG386-1 : TPTP v8.1.2. Released v4.1.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 13:47:04 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.52 Running first-order model finding
% 0.20/0.52 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/tmp/tmp.qqupPahBry/E---3.1_25371.p
% 0.38/0.63 # Version: 3.1.0
% 0.38/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.63 # Starting sh5l with 300s (1) cores
% 0.38/0.63 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 25516 completed with status 0
% 0.38/0.63 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.38/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.63 # No SInE strategy applied
% 0.38/0.63 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.38/0.63 # Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.63 # Starting G-E--_303_C18_F1_URBAN_S0Y with 123s (1) cores
% 0.38/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.38/0.63 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.38/0.63 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 0.38/0.63 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0i with 123s (1) cores
% 0.38/0.63 # U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 25526 completed with status 0
% 0.38/0.63 # Result found by U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN
% 0.38/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.63 # No SInE strategy applied
% 0.38/0.63 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.38/0.63 # Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.63 # Starting G-E--_303_C18_F1_URBAN_S0Y with 123s (1) cores
% 0.38/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.38/0.63 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 0.38/0.63 # Preprocessing time : 0.008 s
% 0.38/0.63 # Presaturation interreduction done
% 0.38/0.63
% 0.38/0.63 # Proof found!
% 0.38/0.63 # SZS status Unsatisfiable
% 0.38/0.63 # SZS output start CNFRefutation
% See solution above
% 0.38/0.63 # Parsed axioms : 594
% 0.38/0.63 # Removed by relevancy pruning/SinE : 0
% 0.38/0.63 # Initial clauses : 594
% 0.38/0.63 # Removed in clause preprocessing : 0
% 0.38/0.63 # Initial clauses in saturation : 594
% 0.38/0.63 # Processed clauses : 796
% 0.38/0.63 # ...of these trivial : 1
% 0.38/0.63 # ...subsumed : 55
% 0.38/0.63 # ...remaining for further processing : 740
% 0.38/0.63 # Other redundant clauses eliminated : 0
% 0.38/0.63 # Clauses deleted for lack of memory : 0
% 0.38/0.63 # Backward-subsumed : 1
% 0.38/0.63 # Backward-rewritten : 1
% 0.38/0.63 # Generated clauses : 28
% 0.38/0.63 # ...of the previous two non-redundant : 15
% 0.38/0.63 # ...aggressively subsumed : 0
% 0.38/0.63 # Contextual simplify-reflections : 0
% 0.38/0.63 # Paramodulations : 28
% 0.38/0.63 # Factorizations : 0
% 0.38/0.63 # NegExts : 0
% 0.38/0.63 # Equation resolutions : 0
% 0.38/0.63 # Disequality decompositions : 0
% 0.38/0.63 # Total rewrite steps : 24
% 0.38/0.63 # ...of those cached : 12
% 0.38/0.63 # Propositional unsat checks : 0
% 0.38/0.63 # Propositional check models : 0
% 0.38/0.63 # Propositional check unsatisfiable : 0
% 0.38/0.63 # Propositional clauses : 0
% 0.38/0.63 # Propositional clauses after purity: 0
% 0.38/0.63 # Propositional unsat core size : 0
% 0.38/0.63 # Propositional preprocessing time : 0.000
% 0.38/0.63 # Propositional encoding time : 0.000
% 0.38/0.63 # Propositional solver time : 0.000
% 0.38/0.63 # Success case prop preproc time : 0.000
% 0.38/0.63 # Success case prop encoding time : 0.000
% 0.38/0.63 # Success case prop solver time : 0.000
% 0.38/0.63 # Current number of processed clauses : 200
% 0.38/0.63 # Positive orientable unit clauses : 139
% 0.38/0.63 # Positive unorientable unit clauses: 1
% 0.38/0.63 # Negative unit clauses : 5
% 0.38/0.63 # Non-unit-clauses : 55
% 0.38/0.63 # Current number of unprocessed clauses: 351
% 0.38/0.63 # ...number of literals in the above : 1030
% 0.38/0.63 # Current number of archived formulas : 0
% 0.38/0.63 # Current number of archived clauses : 540
% 0.38/0.63 # Clause-clause subsumption calls (NU) : 36628
% 0.38/0.63 # Rec. Clause-clause subsumption calls : 21212
% 0.38/0.63 # Non-unit clause-clause subsumptions : 56
% 0.38/0.63 # Unit Clause-clause subsumption calls : 5
% 0.38/0.63 # Rewrite failures with RHS unbound : 0
% 0.38/0.63 # BW rewrite match attempts : 23
% 0.38/0.63 # BW rewrite match successes : 11
% 0.38/0.63 # Condensation attempts : 0
% 0.38/0.63 # Condensation successes : 0
% 0.38/0.63 # Termbank termtop insertions : 20376
% 0.38/0.63 # Search garbage collected termcells : 987
% 0.38/0.63
% 0.38/0.63 # -------------------------------------------------
% 0.38/0.63 # User time : 0.065 s
% 0.38/0.63 # System time : 0.009 s
% 0.38/0.63 # Total time : 0.074 s
% 0.38/0.63 # Maximum resident set size: 2856 pages
% 0.38/0.63
% 0.38/0.63 # -------------------------------------------------
% 0.38/0.63 # User time : 0.315 s
% 0.38/0.63 # System time : 0.032 s
% 0.38/0.63 # Total time : 0.347 s
% 0.38/0.63 # Maximum resident set size: 2112 pages
% 0.38/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------