TSTP Solution File: GRP010-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP010-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:05 EDT 2023
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 13 unt; 0 nHn; 14 RR)
% Number of literals : 34 ( 4 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity2,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
file('/export/starexec/sandbox/tmp/tmp.bvO9zKD5aJ/E---3.1_1388.p',associativity2) ).
cnf(a_multiply_b_is_identity,hypothesis,
product(a,b,identity),
file('/export/starexec/sandbox/tmp/tmp.bvO9zKD5aJ/E---3.1_1388.p',a_multiply_b_is_identity) ).
cnf(right_identity,axiom,
product(X1,identity,X1),
file('/export/starexec/sandbox/tmp/tmp.bvO9zKD5aJ/E---3.1_1388.p',right_identity) ).
cnf(total_function2,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.bvO9zKD5aJ/E---3.1_1388.p',total_function2) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox/tmp/tmp.bvO9zKD5aJ/E---3.1_1388.p',left_identity) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox/tmp/tmp.bvO9zKD5aJ/E---3.1_1388.p',left_inverse) ).
cnf(prove_b_multiply_a_is_identity,negated_conjecture,
~ product(b,a,identity),
file('/export/starexec/sandbox/tmp/tmp.bvO9zKD5aJ/E---3.1_1388.p',prove_b_multiply_a_is_identity) ).
cnf(c_0_7,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
associativity2 ).
cnf(c_0_8,hypothesis,
product(a,b,identity),
a_multiply_b_is_identity ).
cnf(c_0_9,hypothesis,
( product(X1,b,X2)
| ~ product(X3,identity,X2)
| ~ product(X3,a,X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
product(X1,identity,X1),
right_identity ).
cnf(c_0_11,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
total_function2 ).
cnf(c_0_12,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_13,hypothesis,
( product(X1,b,X2)
| ~ product(X2,a,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_15,plain,
( X1 = X2
| ~ product(identity,X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
product(identity,b,inverse(a)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,hypothesis,
inverse(a) = b,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,negated_conjecture,
~ product(b,a,identity),
prove_b_multiply_a_is_identity ).
cnf(c_0_19,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : GRP010-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n011.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 2400
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Tue Oct 3 02:59:38 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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.bvO9zKD5aJ/E---3.1_1388.p
% 0.21/0.53 # Version: 3.1pre001
% 0.21/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # sh5l with pid 1470 completed with status 0
% 0.21/0.53 # Result found by sh5l
% 0.21/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.53 # Search class: FHUSM-FFSF11-SFFFFFNN
% 0.21/0.53 # partial match(1): FHUSM-FFSF21-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.21/0.53 # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 1474 completed with status 0
% 0.21/0.53 # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 0.21/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.53 # Search class: FHUSM-FFSF11-SFFFFFNN
% 0.21/0.53 # partial match(1): FHUSM-FFSF21-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Unsatisfiable
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 10
% 0.21/0.53 # Removed by relevancy pruning/SinE : 1
% 0.21/0.53 # Initial clauses : 9
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 9
% 0.21/0.53 # Processed clauses : 35
% 0.21/0.53 # ...of these trivial : 1
% 0.21/0.53 # ...subsumed : 7
% 0.21/0.53 # ...remaining for further processing : 27
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 0
% 0.21/0.53 # Backward-rewritten : 2
% 0.21/0.53 # Generated clauses : 86
% 0.21/0.53 # ...of the previous two non-redundant : 66
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 86
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Total rewrite steps : 24
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 25
% 0.21/0.53 # Positive orientable unit clauses : 7
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 1
% 0.21/0.53 # Non-unit-clauses : 17
% 0.21/0.53 # Current number of unprocessed clauses: 39
% 0.21/0.53 # ...number of literals in the above : 106
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 2
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 73
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 71
% 0.21/0.53 # Non-unit clause-clause subsumptions : 7
% 0.21/0.53 # Unit Clause-clause subsumption calls : 0
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 2
% 0.21/0.53 # BW rewrite match successes : 1
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 1028
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.003 s
% 0.21/0.53 # System time : 0.001 s
% 0.21/0.53 # Total time : 0.004 s
% 0.21/0.53 # Maximum resident set size: 1648 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.003 s
% 0.21/0.53 # System time : 0.004 s
% 0.21/0.53 # Total time : 0.007 s
% 0.21/0.53 # Maximum resident set size: 1676 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------