TSTP Solution File: GRP001-4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP001-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:36:03 EDT 2023
% Result : Unsatisfiable 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 8 RR)
% Number of literals : 17 ( 16 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.HglbmuCaVH/E---3.1_11724.p',associativity) ).
cnf(squareness,hypothesis,
multiply(X1,X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.HglbmuCaVH/E---3.1_11724.p',squareness) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.HglbmuCaVH/E---3.1_11724.p',left_identity) ).
cnf(a_times_b_is_c,hypothesis,
multiply(a,b) = c,
file('/export/starexec/sandbox/tmp/tmp.HglbmuCaVH/E---3.1_11724.p',a_times_b_is_c) ).
cnf(prove_b_times_a_is_c,negated_conjecture,
multiply(b,a) != c,
file('/export/starexec/sandbox/tmp/tmp.HglbmuCaVH/E---3.1_11724.p',prove_b_times_a_is_c) ).
cnf(c_0_5,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_6,hypothesis,
multiply(X1,X1) = identity,
squareness ).
cnf(c_0_7,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_8,hypothesis,
multiply(X1,multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_9,hypothesis,
multiply(a,b) = c,
a_times_b_is_c ).
cnf(c_0_10,hypothesis,
multiply(a,c) = b,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,hypothesis,
multiply(a,multiply(c,X1)) = multiply(b,X1),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_12,hypothesis,
multiply(b,c) = multiply(a,identity),
inference(spm,[status(thm)],[c_0_11,c_0_6]) ).
cnf(c_0_13,hypothesis,
multiply(X1,identity) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_14,hypothesis,
multiply(b,c) = a,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
multiply(b,a) != c,
prove_b_times_a_is_c ).
cnf(c_0_16,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP001-4 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n001.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 : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 03:26:52 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.HglbmuCaVH/E---3.1_11724.p
% 0.21/0.49 # Version: 3.1pre001
% 0.21/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # new_bool_3 with pid 11810 completed with status 0
% 0.21/0.49 # Result found by new_bool_3
% 0.21/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 # Search class: FUUPS-FFSF22-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.21/0.49 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 11815 completed with status 0
% 0.21/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.21/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 # Search class: FUUPS-FFSF22-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 181s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Unsatisfiable
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 5
% 0.21/0.49 # Removed by relevancy pruning/SinE : 0
% 0.21/0.49 # Initial clauses : 5
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 5
% 0.21/0.49 # Processed clauses : 20
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 0
% 0.21/0.49 # ...remaining for further processing : 20
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 0
% 0.21/0.49 # Backward-rewritten : 3
% 0.21/0.49 # Generated clauses : 67
% 0.21/0.49 # ...of the previous two non-redundant : 35
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 67
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 0
% 0.21/0.49 # Total rewrite steps : 81
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 12
% 0.21/0.49 # Positive orientable unit clauses : 11
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 1
% 0.21/0.49 # Non-unit-clauses : 0
% 0.21/0.49 # Current number of unprocessed clauses: 23
% 0.21/0.49 # ...number of literals in the above : 23
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 8
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.49 # Non-unit clause-clause subsumptions : 0
% 0.21/0.49 # Unit Clause-clause subsumption calls : 0
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 8
% 0.21/0.49 # BW rewrite match successes : 1
% 0.21/0.49 # Condensation attempts : 0
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 586
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.004 s
% 0.21/0.49 # System time : 0.000 s
% 0.21/0.49 # Total time : 0.004 s
% 0.21/0.49 # Maximum resident set size: 1424 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.007 s
% 0.21/0.49 # System time : 0.001 s
% 0.21/0.49 # Total time : 0.007 s
% 0.21/0.49 # Maximum resident set size: 1668 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------