TSTP Solution File: GRP022-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP022-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 20:43:39 EDT 2024
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 12 unt; 0 nHn; 13 RR)
% Number of literals : 40 ( 8 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 46 ( 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/sandbox2/benchmark/Axioms/GRP003-0.ax',associativity2) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_inverse) ).
cnf(total_function2,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',total_function2) ).
cnf(right_identity,axiom,
product(X1,identity,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',right_identity) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_identity) ).
cnf(prove_inverse_of_inverse_is_original,negated_conjecture,
inverse(inverse(a)) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_inverse_of_inverse_is_original) ).
cnf(c_0_6,plain,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[associativity2]) ).
cnf(c_0_7,plain,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
c_0_6 ).
cnf(c_0_8,axiom,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_9,plain,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[total_function2]) ).
cnf(c_0_10,plain,
( product(identity,X1,X2)
| ~ product(inverse(X3),X4,X2)
| ~ product(X3,X1,X4) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
product(X1,identity,X1),
right_identity ).
cnf(c_0_12,plain,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
c_0_9 ).
cnf(c_0_13,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_14,plain,
( product(identity,X1,inverse(X2))
| ~ product(X2,X1,identity) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
inverse(inverse(a)) != a,
inference(fof_simplification,[status(thm)],[prove_inverse_of_inverse_is_original]) ).
cnf(c_0_16,plain,
( X1 = X2
| ~ product(identity,X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
product(identity,X1,inverse(inverse(X1))),
inference(spm,[status(thm)],[c_0_14,c_0_8]) ).
cnf(c_0_18,negated_conjecture,
inverse(inverse(a)) != a,
c_0_15 ).
cnf(c_0_19,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP022-1 : TPTP v8.2.0. Released v1.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 05:10:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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/benchmark/theBenchmark.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # sh5l with pid 27624 completed with status 0
% 0.20/0.49 # Result found by sh5l
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FHUSM-FFSF11-SFFFFFNN
% 0.20/0.49 # partial match(1): FHUSM-FFSF21-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.20/0.49 # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 27631 completed with status 0
% 0.20/0.49 # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FHUSM-FFSF11-SFFFFFNN
% 0.20/0.49 # partial match(1): FHUSM-FFSF21-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Unsatisfiable
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 9
% 0.20/0.49 # Removed by relevancy pruning/SinE : 1
% 0.20/0.49 # Initial clauses : 8
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 8
% 0.20/0.49 # Processed clauses : 35
% 0.20/0.49 # ...of these trivial : 1
% 0.20/0.49 # ...subsumed : 6
% 0.20/0.49 # ...remaining for further processing : 28
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 4
% 0.20/0.49 # Generated clauses : 117
% 0.20/0.49 # ...of the previous two non-redundant : 68
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 117
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 62
% 0.20/0.49 # ...of those cached : 52
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 24
% 0.20/0.49 # Positive orientable unit clauses : 6
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 0
% 0.20/0.49 # Non-unit-clauses : 18
% 0.20/0.49 # Current number of unprocessed clauses: 39
% 0.20/0.49 # ...number of literals in the above : 103
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 4
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 137
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 125
% 0.20/0.49 # Non-unit clause-clause subsumptions : 6
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 13
% 0.20/0.49 # BW rewrite match successes : 3
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1306
% 0.20/0.49 # Search garbage collected termcells : 21
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.003 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.005 s
% 0.20/0.49 # Maximum resident set size: 1620 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.003 s
% 0.20/0.49 # System time : 0.005 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1704 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------