TSTP Solution File: GRP009-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP009-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:43:27 EDT 2023
% Result : Timeout 408.19s 300.15s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 30 ( 21 unt; 0 nHn; 22 RR)
% Number of literals : 47 ( 7 equ; 19 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 : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 40 ( 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.NH3AKTJGod/E---3.1_30782.p',associativity2) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox/tmp/tmp.NH3AKTJGod/E---3.1_30782.p',left_inverse) ).
cnf(right_identity,axiom,
product(X1,identity,X1),
file('/export/starexec/sandbox/tmp/tmp.NH3AKTJGod/E---3.1_30782.p',right_identity) ).
cnf(c_is_an_inverse_of_b,hypothesis,
product(c,b,identity),
file('/export/starexec/sandbox/tmp/tmp.NH3AKTJGod/E---3.1_30782.p',c_is_an_inverse_of_b) ).
cnf(total_function2,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.NH3AKTJGod/E---3.1_30782.p',total_function2) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox/tmp/tmp.NH3AKTJGod/E---3.1_30782.p',left_identity) ).
cnf(a_is_an_inverse_of_b,hypothesis,
product(a,b,identity),
file('/export/starexec/sandbox/tmp/tmp.NH3AKTJGod/E---3.1_30782.p',a_is_an_inverse_of_b) ).
cnf(right_inverse,axiom,
product(X1,inverse(X1),identity),
file('/export/starexec/sandbox/tmp/tmp.NH3AKTJGod/E---3.1_30782.p',right_inverse) ).
cnf(prove_a_equals_c,negated_conjecture,
a != c,
file('/export/starexec/sandbox/tmp/tmp.NH3AKTJGod/E---3.1_30782.p',prove_a_equals_c) ).
cnf(c_0_9,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
associativity2 ).
cnf(c_0_10,axiom,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_11,plain,
( product(identity,X1,X2)
| ~ product(inverse(X3),X4,X2)
| ~ product(X3,X1,X4) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
product(X1,identity,X1),
right_identity ).
cnf(c_0_13,hypothesis,
product(c,b,identity),
c_is_an_inverse_of_b ).
cnf(c_0_14,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
total_function2 ).
cnf(c_0_15,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_16,plain,
( product(identity,X1,inverse(X2))
| ~ product(X2,X1,identity) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,hypothesis,
product(a,b,identity),
a_is_an_inverse_of_b ).
cnf(c_0_18,hypothesis,
( product(identity,X1,X2)
| ~ product(b,X1,X3)
| ~ product(c,X3,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_19,plain,
( X1 = X2
| ~ product(identity,X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,hypothesis,
product(identity,b,inverse(a)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,hypothesis,
( product(identity,X1,c)
| ~ product(b,X1,identity) ),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_22,axiom,
product(X1,inverse(X1),identity),
right_inverse ).
cnf(c_0_23,hypothesis,
inverse(a) = b,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,hypothesis,
product(identity,inverse(b),c),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,hypothesis,
product(b,a,identity),
inference(spm,[status(thm)],[c_0_10,c_0_23]) ).
cnf(c_0_26,hypothesis,
inverse(b) = c,
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_27,hypothesis,
product(identity,a,c),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_25]),c_0_26]) ).
cnf(c_0_28,negated_conjecture,
a != c,
prove_a_equals_c ).
cnf(c_0_29,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP009-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : run_E %s %d THM
% 0.17/0.35 % Computer : n025.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 2400
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Tue Oct 3 02:50:36 EDT 2023
% 0.17/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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/tmp/tmp.NH3AKTJGod/E---3.1_30782.p
% 408.19/300.15 # Version: 3.1pre001
% 408.19/300.15 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.19/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.19/300.15 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.19/300.15 # Starting new_bool_3 with 300s (1) cores
% 408.19/300.15 # Starting new_bool_1 with 300s (1) cores
% 408.19/300.15 # Starting sh5l with 300s (1) cores
% 408.19/300.15 # sh5l with pid 31133 completed with status 0
% 408.19/300.15 # Result found by sh5l
% 408.19/300.15 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.19/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.19/300.15 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.19/300.15 # Starting new_bool_3 with 300s (1) cores
% 408.19/300.15 # Starting new_bool_1 with 300s (1) cores
% 408.19/300.15 # Starting sh5l with 300s (1) cores
% 408.19/300.15 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.19/300.15 # Search class: FHUSM-FFSF11-SFFFFFNN
% 408.19/300.15 # partial match(1): FHUSM-FFSF21-SFFFFFNN
% 408.19/300.15 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.19/300.15 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 408.19/300.15 # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 31147 completed with status 0
% 408.19/300.15 # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 408.19/300.15 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.19/300.15 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.19/300.15 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.19/300.15 # Starting new_bool_3 with 300s (1) cores
% 408.19/300.15 # Starting new_bool_1 with 300s (1) cores
% 408.19/300.15 # Starting sh5l with 300s (1) cores
% 408.19/300.15 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.19/300.15 # Search class: FHUSM-FFSF11-SFFFFFNN
% 408.19/300.15 # partial match(1): FHUSM-FFSF21-SFFFFFNN
% 408.19/300.15 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.19/300.15 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 408.19/300.15 # Preprocessing time : 0.001 s
% 408.19/300.15
% 408.19/300.15 # Proof found!
% 408.19/300.15 # SZS status Unsatisfiable
% 408.19/300.15 # SZS output start CNFRefutation
% See solution above
% 408.19/300.15 # Parsed axioms : 11
% 408.19/300.15 # Removed by relevancy pruning/SinE : 1
% 408.19/300.15 # Initial clauses : 10
% 408.19/300.15 # Removed in clause preprocessing : 0
% 408.19/300.15 # Initial clauses in saturation : 10
% 408.19/300.15 # Processed clauses : 57
% 408.19/300.15 # ...of these trivial : 0
% 408.19/300.15 # ...subsumed : 16
% 408.19/300.15 # ...remaining for further processing : 41
% 408.19/300.15 # Other redundant clauses eliminated : 0
% 408.19/300.15 # Clauses deleted for lack of memory : 0
% 408.19/300.15 # Backward-subsumed : 0
% 408.19/300.15 # Backward-rewritten : 4
% 408.19/300.15 # Generated clauses : 167
% 408.19/300.15 # ...of the previous two non-redundant : 131
% 408.19/300.15 # ...aggressively subsumed : 0
% 408.19/300.15 # Contextual simplify-reflections : 0
% 408.19/300.15 # Paramodulations : 167
% 408.19/300.15 # Factorizations : 0
% 408.19/300.15 # NegExts : 0
% 408.19/300.15 # Equation resolutions : 0
% 408.19/300.15 # Total rewrite steps : 45
% 408.19/300.15 # Propositional unsat checks : 0
% 408.19/300.15 # Propositional check models : 0
% 408.19/300.15 # Propositional check unsatisfiable : 0
% 408.19/300.15 # Propositional clauses : 0
% 408.19/300.15 # Propositional clauses after purity: 0
% 408.19/300.15 # Propositional unsat core size : 0
% 408.19/300.15 # Propositional preprocessing time : 0.000
% 408.19/300.15 # Propositional encoding time : 0.000
% 408.19/300.15 # Propositional solver time : 0.000
% 408.19/300.15 # Success case prop preproc time : 0.000
% 408.19/300.15 # Success case prop encoding time : 0.000
% 408.19/300.15 # Success case prop solver time : 0.000
% 408.19/300.15 # Current number of processed clauses : 37
% 408.19/300.15 # Positive orientable unit clauses : 13
% 408.19/300.15 # Positive unorientable unit clauses: 0
% 408.19/300.15 # Negative unit clauses : 1
% 408.19/300.15 # Non-unit-clauses : 23
% 408.19/300.15 # Current number of unprocessed clauses: 76
% 408.19/300.15 # ...number of literals in the above : 207
% 408.19/300.15 # Current number of archived formulas : 0
% 408.19/300.15 # Current number of archived clauses : 4
% 408.19/300.15 # Clause-clause subsumption calls (NU) : 194
% 408.19/300.15 # Rec. Clause-clause subsumption calls : 186
% 408.19/300.15 # Non-unit clause-clause subsumptions : 16
% 408.19/300.15 # Unit Clause-clause subsumption calls : 0
% 408.19/300.15 # Rewrite failures with RHS unbound : 0
% 408.19/300.15 # BW rewrite match attempts : 5
% 408.19/300.15 # BW rewrite match successes : 3
% 408.19/300.15 # Condensation attempts : 0
% 408.19/300.15 # Condensation successes : 0
% 408.19/300.15 # Termbank termtop insertions : 1805
% 408.19/300.15
% 408.19/300.15 # -------------------------------------------------
% 408.19/300.15 # User time : 0.004 s
% 408.19/300.15 # System time : 0.003 s
% 408.19/300.15 # Total time : 0.007 s
% 408.19/300.15 # Maximum resident set size: 1648 pages
% 408.19/300.15
% 408.19/300.15 # -------------------------------------------------
% 408.19/300.15 # User time : 0.004 s
% 408.19/300.15 # System time : 0.007 s
% 408.19/300.15 # Total time : 0.010 s
% 408.19/300.15 # Maximum resident set size: 1672 pages
% 408.19/300.15 % E---3.1 exiting
%------------------------------------------------------------------------------