TSTP Solution File: ALG425-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG425-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:19 EDT 2024
% Result : Unsatisfiable 0.16s 0.46s
% Output : CNFRefutation 0.16s
% 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 : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 3 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
c_Power_Opower__class_Opower(v_qa____,v_na____,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) != c_HOL_Otimes__class_Otimes(v_pa____,X1,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_CHAINED_0,axiom,
c_Power_Opower__class_Opower(v_qa____,v_na____,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) = c_HOL_Otimes__class_Otimes(v_pa____,c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),v_c____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),c_Power_Opower__class_Opower(v_qa____,v_na____,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_CHAINED_0) ).
cnf(c_0_2,negated_conjecture,
c_Power_Opower__class_Opower(v_qa____,v_na____,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) != c_HOL_Otimes__class_Otimes(v_pa____,X1,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_3,axiom,
c_Power_Opower__class_Opower(v_qa____,v_na____,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) = c_HOL_Otimes__class_Otimes(v_pa____,c_HOL_Otimes__class_Otimes(c_Polynomial_OpCons(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_Complex_Ocomplex),v_c____,tc_Complex_Ocomplex),c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),c_Power_Opower__class_Opower(v_qa____,v_na____,tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Polynomial_Opoly(tc_Complex_Ocomplex)),
cls_CHAINED_0 ).
cnf(c_0_4,negated_conjecture,
c_Power_Opower__class_Opower(v_qa____,v_na____,tc_Polynomial_Opoly(tc_Complex_Ocomplex)) != c_HOL_Otimes__class_Otimes(v_pa____,X1,tc_Polynomial_Opoly(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.07/0.11 % Problem : ALG425-1 : TPTP v8.2.0. Released v4.1.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sat May 18 23:22:22 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 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.46 # Version: 3.1.0
% 0.16/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # sh5l with pid 20684 completed with status 0
% 0.16/0.46 # Result found by sh5l
% 0.16/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.46 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.16/0.46 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.16/0.46 # G-E--_303_C18_F1_URBAN_S0Y with pid 20687 completed with status 0
% 0.16/0.46 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 0.16/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.46 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.16/0.46 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.16/0.46 # Preprocessing time : 0.008 s
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Unsatisfiable
% 0.16/0.46 # SZS output start CNFRefutation
% See solution above
% 0.16/0.46 # Parsed axioms : 793
% 0.16/0.46 # Removed by relevancy pruning/SinE : 98
% 0.16/0.46 # Initial clauses : 695
% 0.16/0.46 # Removed in clause preprocessing : 0
% 0.16/0.46 # Initial clauses in saturation : 695
% 0.16/0.46 # Processed clauses : 92
% 0.16/0.46 # ...of these trivial : 4
% 0.16/0.46 # ...subsumed : 7
% 0.16/0.46 # ...remaining for further processing : 80
% 0.16/0.46 # Other redundant clauses eliminated : 0
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 0
% 0.16/0.46 # Backward-rewritten : 4
% 0.16/0.46 # Generated clauses : 24
% 0.16/0.46 # ...of the previous two non-redundant : 22
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 0
% 0.16/0.46 # Paramodulations : 21
% 0.16/0.46 # Factorizations : 0
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 3
% 0.16/0.46 # Disequality decompositions : 0
% 0.16/0.46 # Total rewrite steps : 24
% 0.16/0.46 # ...of those cached : 17
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 76
% 0.16/0.46 # Positive orientable unit clauses : 48
% 0.16/0.46 # Positive unorientable unit clauses: 0
% 0.16/0.46 # Negative unit clauses : 4
% 0.16/0.46 # Non-unit-clauses : 24
% 0.16/0.46 # Current number of unprocessed clauses: 625
% 0.16/0.46 # ...number of literals in the above : 1782
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 4
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 108
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 107
% 0.16/0.46 # Non-unit clause-clause subsumptions : 3
% 0.16/0.46 # Unit Clause-clause subsumption calls : 3
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 3
% 0.16/0.46 # BW rewrite match successes : 3
% 0.16/0.46 # Condensation attempts : 0
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 19713
% 0.16/0.46 # Search garbage collected termcells : 1582
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.019 s
% 0.16/0.46 # System time : 0.006 s
% 0.16/0.46 # Total time : 0.025 s
% 0.16/0.46 # Maximum resident set size: 3268 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.031 s
% 0.16/0.46 # System time : 0.008 s
% 0.16/0.46 # Total time : 0.038 s
% 0.16/0.46 # Maximum resident set size: 2240 pages
% 0.16/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------