TSTP Solution File: GRP494-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP494-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 17:41:23 EDT 2023
% Result : Unsatisfiable 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 5 RR)
% Number of literals : 19 ( 18 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox/tmp/tmp.842II1GHsG/E---3.1_19628.p',identity) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox/tmp/tmp.842II1GHsG/E---3.1_19628.p',inverse) ).
cnf(single_axiom,axiom,
double_divide(double_divide(identity,X1),double_divide(double_divide(double_divide(X2,X3),double_divide(identity,identity)),double_divide(X1,X3))) = X2,
file('/export/starexec/sandbox/tmp/tmp.842II1GHsG/E---3.1_19628.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(identity,a2) != a2,
file('/export/starexec/sandbox/tmp/tmp.842II1GHsG/E---3.1_19628.p',prove_these_axioms_2) ).
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox/tmp/tmp.842II1GHsG/E---3.1_19628.p',multiply) ).
cnf(c_0_5,axiom,
identity = double_divide(X1,inverse(X1)),
identity ).
cnf(c_0_6,axiom,
inverse(X1) = double_divide(X1,identity),
inverse ).
cnf(c_0_7,axiom,
double_divide(double_divide(identity,X1),double_divide(double_divide(double_divide(X2,X3),double_divide(identity,identity)),double_divide(X1,X3))) = X2,
single_axiom ).
cnf(c_0_8,plain,
identity = double_divide(X1,double_divide(X1,identity)),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
double_divide(double_divide(identity,X1),double_divide(identity,double_divide(X1,double_divide(X2,identity)))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_10,plain,
double_divide(double_divide(identity,X1),double_divide(identity,identity)) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,plain,
double_divide(identity,identity) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_8]),c_0_8]) ).
cnf(c_0_12,negated_conjecture,
multiply(identity,a2) != a2,
prove_these_axioms_2 ).
cnf(c_0_13,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_14,plain,
double_divide(double_divide(identity,double_divide(double_divide(X1,identity),double_divide(identity,identity))),identity) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_15,plain,
double_divide(double_divide(identity,X1),identity) = X1,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
double_divide(double_divide(a2,identity),identity) != a2,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
double_divide(double_divide(X1,identity),identity) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_11]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRP494-1 : TPTP v8.1.2. Released v2.6.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n003.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 : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 02:14:48 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.842II1GHsG/E---3.1_19628.p
% 0.16/0.43 # Version: 3.1pre001
% 0.16/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43 # Starting sh5l with 300s (1) cores
% 0.16/0.43 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 19706 completed with status 0
% 0.16/0.43 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43 # No SInE strategy applied
% 0.16/0.43 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.16/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 811s (1) cores
% 0.16/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.43 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.43 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.43 # Starting sh5l with 136s (1) cores
% 0.16/0.43 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 19713 completed with status 0
% 0.16/0.43 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43 # No SInE strategy applied
% 0.16/0.43 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.16/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 811s (1) cores
% 0.16/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.43 # Preprocessing time : 0.001 s
% 0.16/0.43
% 0.16/0.43 # Proof found!
% 0.16/0.43 # SZS status Unsatisfiable
% 0.16/0.43 # SZS output start CNFRefutation
% See solution above
% 0.16/0.43 # Parsed axioms : 5
% 0.16/0.43 # Removed by relevancy pruning/SinE : 0
% 0.16/0.43 # Initial clauses : 5
% 0.16/0.43 # Removed in clause preprocessing : 2
% 0.16/0.43 # Initial clauses in saturation : 3
% 0.16/0.43 # Processed clauses : 9
% 0.16/0.43 # ...of these trivial : 0
% 0.16/0.43 # ...subsumed : 0
% 0.16/0.43 # ...remaining for further processing : 9
% 0.16/0.43 # Other redundant clauses eliminated : 0
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 0
% 0.16/0.43 # Backward-rewritten : 3
% 0.16/0.43 # Generated clauses : 41
% 0.16/0.43 # ...of the previous two non-redundant : 34
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 0
% 0.16/0.43 # Paramodulations : 41
% 0.16/0.43 # Factorizations : 0
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 0
% 0.16/0.43 # Total rewrite steps : 17
% 0.16/0.43 # Propositional unsat checks : 0
% 0.16/0.43 # Propositional check models : 0
% 0.16/0.43 # Propositional check unsatisfiable : 0
% 0.16/0.43 # Propositional clauses : 0
% 0.16/0.43 # Propositional clauses after purity: 0
% 0.16/0.43 # Propositional unsat core size : 0
% 0.16/0.43 # Propositional preprocessing time : 0.000
% 0.16/0.43 # Propositional encoding time : 0.000
% 0.16/0.43 # Propositional solver time : 0.000
% 0.16/0.43 # Success case prop preproc time : 0.000
% 0.16/0.43 # Success case prop encoding time : 0.000
% 0.16/0.43 # Success case prop solver time : 0.000
% 0.16/0.43 # Current number of processed clauses : 6
% 0.16/0.43 # Positive orientable unit clauses : 6
% 0.16/0.43 # Positive unorientable unit clauses: 0
% 0.16/0.43 # Negative unit clauses : 0
% 0.16/0.43 # Non-unit-clauses : 0
% 0.16/0.43 # Current number of unprocessed clauses: 27
% 0.16/0.43 # ...number of literals in the above : 27
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 5
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.43 # Non-unit clause-clause subsumptions : 0
% 0.16/0.43 # Unit Clause-clause subsumption calls : 0
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 3
% 0.16/0.43 # BW rewrite match successes : 3
% 0.16/0.43 # Condensation attempts : 0
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 586
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.004 s
% 0.16/0.43 # System time : 0.000 s
% 0.16/0.43 # Total time : 0.004 s
% 0.16/0.43 # Maximum resident set size: 1560 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.012 s
% 0.16/0.43 # System time : 0.005 s
% 0.16/0.43 # Total time : 0.017 s
% 0.16/0.43 # Maximum resident set size: 1668 pages
% 0.16/0.43 % E---3.1 exiting
% 0.16/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------