TSTP Solution File: ALG414-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ALG414-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:06:20 EDT 2024
% Result : Unsatisfiable 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of clauses : 6 ( 6 unt; 0 nHn; 6 RR)
% Number of literals : 6 ( 5 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_CHAINED_0,axiom,
c_RealVector_Onorm__class_Onorm(c_HOL_Otimes__class_Otimes(c_RealVector_Oof__real(v_x____,tc_Complex_Ocomplex),c_Polynomial_Opoly(v_ds____,c_RealVector_Oof__real(v_x____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_RealVector_Onorm__class_Onorm(v_d____,tc_Complex_Ocomplex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CHAINED_0) ).
cnf(cls_CHAINED_0_01,axiom,
c_RealVector_Onorm__class_Onorm(c_HOL_Otimes__class_Otimes(c_RealVector_Oof__real(v_x____,tc_Complex_Ocomplex),c_Polynomial_Opoly(v_ds____,c_RealVector_Oof__real(v_x____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex) = c_RealVector_Onorm__class_Onorm(v_d____,tc_Complex_Ocomplex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CHAINED_0_01) ).
cnf(c_0_2,plain,
c_RealVector_Onorm__class_Onorm(c_HOL_Otimes__class_Otimes(c_RealVector_Oof__real(v_x____,tc_Complex_Ocomplex),c_Polynomial_Opoly(v_ds____,c_RealVector_Oof__real(v_x____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_RealVector_Onorm__class_Onorm(v_d____,tc_Complex_Ocomplex),
inference(fof_simplification,[status(thm)],[cls_CHAINED_0]) ).
cnf(c_0_3,axiom,
c_RealVector_Onorm__class_Onorm(c_HOL_Otimes__class_Otimes(c_RealVector_Oof__real(v_x____,tc_Complex_Ocomplex),c_Polynomial_Opoly(v_ds____,c_RealVector_Oof__real(v_x____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex) = c_RealVector_Onorm__class_Onorm(v_d____,tc_Complex_Ocomplex),
cls_CHAINED_0_01 ).
cnf(c_0_4,plain,
c_RealVector_Onorm__class_Onorm(c_HOL_Otimes__class_Otimes(c_RealVector_Oof__real(v_x____,tc_Complex_Ocomplex),c_Polynomial_Opoly(v_ds____,c_RealVector_Oof__real(v_x____,tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex),tc_Complex_Ocomplex) != c_RealVector_Onorm__class_Onorm(v_d____,tc_Complex_Ocomplex),
c_0_2 ).
cnf(c_0_5,plain,
$false,
inference(sr,[status(thm)],[c_0_3,c_0_4]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG414-1 : TPTP v8.2.0. Released v4.1.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n026.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat May 18 23:19:38 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.21/0.54 # Version: 3.1.0
% 0.21/0.54 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.21/0.54 # Starting new_bool_3 with 600s (2) cores
% 0.21/0.54 # Starting new_bool_1 with 600s (2) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # sh5l with pid 9929 completed with status 0
% 0.21/0.54 # Result found by sh5l
% 0.21/0.54 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.21/0.54 # Starting new_bool_3 with 600s (2) cores
% 0.21/0.54 # Starting new_bool_1 with 600s (2) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.54 # Search class: FGHSF-FSLM32-DFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.54 # SAT001_MinMin_p005000_rr_RG with pid 9943 completed with status 0
% 0.21/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.54 # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.21/0.54 # Starting new_bool_3 with 600s (2) cores
% 0.21/0.54 # Starting new_bool_1 with 600s (2) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.54 # Search class: FGHSF-FSLM32-DFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.54 # Preprocessing time : 0.010 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Unsatisfiable
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 836
% 0.21/0.54 # Removed by relevancy pruning/SinE : 152
% 0.21/0.54 # Initial clauses : 684
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 684
% 0.21/0.54 # Processed clauses : 289
% 0.21/0.54 # ...of these trivial : 0
% 0.21/0.54 # ...subsumed : 27
% 0.21/0.54 # ...remaining for further processing : 261
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 0
% 0.21/0.54 # Backward-rewritten : 0
% 0.21/0.54 # Generated clauses : 0
% 0.21/0.54 # ...of the previous two non-redundant : 0
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 0
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 0
% 0.21/0.54 # ...of those cached : 0
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 261
% 0.21/0.54 # Positive orientable unit clauses : 68
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 5
% 0.21/0.54 # Non-unit-clauses : 188
% 0.21/0.54 # Current number of unprocessed clauses: 395
% 0.21/0.54 # ...number of literals in the above : 1218
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 0
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 4083
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 3468
% 0.21/0.54 # Non-unit clause-clause subsumptions : 22
% 0.21/0.54 # Unit Clause-clause subsumption calls : 115
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 0
% 0.21/0.54 # BW rewrite match successes : 0
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 20962
% 0.21/0.54 # Search garbage collected termcells : 1750
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.034 s
% 0.21/0.54 # System time : 0.004 s
% 0.21/0.54 # Total time : 0.038 s
% 0.21/0.54 # Maximum resident set size: 3344 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.056 s
% 0.21/0.54 # System time : 0.007 s
% 0.21/0.54 # Total time : 0.063 s
% 0.21/0.54 # Maximum resident set size: 2280 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.55 % E exiting
%------------------------------------------------------------------------------