TSTP Solution File: GRP116-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP116-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:38:00 EDT 2023
% Result : Timeout 0.28s 300.18s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 3 RR)
% Number of literals : 14 ( 13 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,multiply(multiply(X1,multiply(multiply(X1,X2),X3)),multiply(identity,multiply(X3,X3)))) = X2,
file('/export/starexec/sandbox2/tmp/tmp.ImsATazWT7/E---3.1_22950.p',single_axiom) ).
cnf(prove_order3,negated_conjecture,
multiply(identity,a) != a,
file('/export/starexec/sandbox2/tmp/tmp.ImsATazWT7/E---3.1_22950.p',prove_order3) ).
cnf(c_0_2,axiom,
multiply(X1,multiply(multiply(X1,multiply(multiply(X1,X2),X3)),multiply(identity,multiply(X3,X3)))) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,multiply(multiply(X1,multiply(multiply(X1,X2),multiply(identity,multiply(multiply(identity,X3),multiply(identity,X3))))),X3)) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(multiply(X1,X2),multiply(identity,X3)) = multiply(X1,multiply(X2,X3)),
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
multiply(X1,multiply(X1,multiply(multiply(multiply(X1,X2),X3),multiply(X3,X3)))) = X2,
inference(rw,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_6,plain,
multiply(X1,multiply(X1,multiply(X1,multiply(multiply(X2,X3),multiply(X3,X3))))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_4]),c_0_4]),c_0_4]) ).
cnf(c_0_7,plain,
multiply(multiply(X1,multiply(X2,X2)),X2) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_8,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_7]),c_0_4]),c_0_7]) ).
cnf(c_0_9,plain,
multiply(X1,multiply(X1,multiply(X1,X2))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_10,plain,
multiply(X1,multiply(X1,X1)) = identity,
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
multiply(identity,a) != a,
prove_order3 ).
cnf(c_0_12,plain,
multiply(identity,X1) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GRP116-1 : TPTP v8.1.2. Released v1.2.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n018.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Oct 3 02:43:24 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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/tmp/tmp.ImsATazWT7/E---3.1_22950.p
% 0.28/300.18 # Version: 3.1pre001
% 0.28/300.18 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.28/300.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/300.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.28/300.18 # Starting new_bool_3 with 300s (1) cores
% 0.28/300.18 # Starting new_bool_1 with 300s (1) cores
% 0.28/300.18 # Starting sh5l with 300s (1) cores
% 0.28/300.18 # new_bool_3 with pid 23033 completed with status 0
% 0.28/300.18 # Result found by new_bool_3
% 0.28/300.18 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.28/300.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/300.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.28/300.18 # Starting new_bool_3 with 300s (1) cores
% 0.28/300.18 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/300.18 # Search class: FUUPF-FFSF22-MFFFFFNN
% 0.28/300.18 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/300.18 # Starting G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with 93s (1) cores
% 0.28/300.18 # G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with pid 23038 completed with status 0
% 0.28/300.18 # Result found by G-E--_209_C18_F1_AE_CS_SP_PI_S0Y
% 0.28/300.18 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.28/300.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/300.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.28/300.18 # Starting new_bool_3 with 300s (1) cores
% 0.28/300.18 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/300.18 # Search class: FUUPF-FFSF22-MFFFFFNN
% 0.28/300.18 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/300.18 # Starting G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with 93s (1) cores
% 0.28/300.18 # Preprocessing time : 0.001 s
% 0.28/300.18
% 0.28/300.18 # Proof found!
% 0.28/300.18 # SZS status Unsatisfiable
% 0.28/300.18 # SZS output start CNFRefutation
% See solution above
% 0.28/300.18 # Parsed axioms : 2
% 0.28/300.18 # Removed by relevancy pruning/SinE : 0
% 0.28/300.18 # Initial clauses : 2
% 0.28/300.18 # Removed in clause preprocessing : 0
% 0.28/300.18 # Initial clauses in saturation : 2
% 0.28/300.18 # Processed clauses : 14
% 0.28/300.18 # ...of these trivial : 1
% 0.28/300.18 # ...subsumed : 0
% 0.28/300.18 # ...remaining for further processing : 13
% 0.28/300.18 # Other redundant clauses eliminated : 0
% 0.28/300.18 # Clauses deleted for lack of memory : 0
% 0.28/300.18 # Backward-subsumed : 0
% 0.28/300.18 # Backward-rewritten : 6
% 0.28/300.18 # Generated clauses : 128
% 0.28/300.18 # ...of the previous two non-redundant : 102
% 0.28/300.18 # ...aggressively subsumed : 0
% 0.28/300.18 # Contextual simplify-reflections : 0
% 0.28/300.18 # Paramodulations : 128
% 0.28/300.18 # Factorizations : 0
% 0.28/300.18 # NegExts : 0
% 0.28/300.18 # Equation resolutions : 0
% 0.28/300.18 # Total rewrite steps : 115
% 0.28/300.18 # Propositional unsat checks : 0
% 0.28/300.18 # Propositional check models : 0
% 0.28/300.18 # Propositional check unsatisfiable : 0
% 0.28/300.18 # Propositional clauses : 0
% 0.28/300.18 # Propositional clauses after purity: 0
% 0.28/300.18 # Propositional unsat core size : 0
% 0.28/300.18 # Propositional preprocessing time : 0.000
% 0.28/300.18 # Propositional encoding time : 0.000
% 0.28/300.18 # Propositional solver time : 0.000
% 0.28/300.18 # Success case prop preproc time : 0.000
% 0.28/300.18 # Success case prop encoding time : 0.000
% 0.28/300.18 # Success case prop solver time : 0.000
% 0.28/300.18 # Current number of processed clauses : 7
% 0.28/300.18 # Positive orientable unit clauses : 7
% 0.28/300.18 # Positive unorientable unit clauses: 0
% 0.28/300.18 # Negative unit clauses : 0
% 0.28/300.18 # Non-unit-clauses : 0
% 0.28/300.18 # Current number of unprocessed clauses: 89
% 0.28/300.18 # ...number of literals in the above : 89
% 0.28/300.18 # Current number of archived formulas : 0
% 0.28/300.18 # Current number of archived clauses : 6
% 0.28/300.18 # Clause-clause subsumption calls (NU) : 0
% 0.28/300.18 # Rec. Clause-clause subsumption calls : 0
% 0.28/300.18 # Non-unit clause-clause subsumptions : 0
% 0.28/300.18 # Unit Clause-clause subsumption calls : 0
% 0.28/300.18 # Rewrite failures with RHS unbound : 0
% 0.28/300.18 # BW rewrite match attempts : 27
% 0.28/300.18 # BW rewrite match successes : 7
% 0.28/300.18 # Condensation attempts : 0
% 0.28/300.18 # Condensation successes : 0
% 0.28/300.18 # Termbank termtop insertions : 1778
% 0.28/300.18
% 0.28/300.18 # -------------------------------------------------
% 0.28/300.18 # User time : 0.004 s
% 0.28/300.18 # System time : 0.000 s
% 0.28/300.18 # Total time : 0.004 s
% 0.28/300.18 # Maximum resident set size: 1424 pages
% 0.28/300.18
% 0.28/300.18 # -------------------------------------------------
% 0.28/300.18 # User time : 0.005 s
% 0.28/300.18 # System time : 0.001 s
% 0.28/300.18 # Total time : 0.006 s
% 0.28/300.18 # Maximum resident set size: 1668 pages
% 0.28/300.18 % E---3.1 exiting
% 0.28/300.18 % E---3.1 exiting
%------------------------------------------------------------------------------