TSTP Solution File: GRP003-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP003-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : Sat May 4 07:46:52 EDT 2024
% Result : Unsatisfiable 62.27s 31.54s
% Output : CNFRefutation 62.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 22 ( 10 unt; 0 nHn; 16 RR)
% Number of literals : 49 ( 0 equ; 30 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 62 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity1,axiom,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
file('/export/starexec/sandbox/tmp/tmp.5iJb6CsDf8/E---3.1_20835.p',associativity1) ).
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.5iJb6CsDf8/E---3.1_20835.p',associativity2) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox/tmp/tmp.5iJb6CsDf8/E---3.1_20835.p',left_identity) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox/tmp/tmp.5iJb6CsDf8/E---3.1_20835.p',left_inverse) ).
cnf(prove_right_identity,negated_conjecture,
~ product(a,identity,a),
file('/export/starexec/sandbox/tmp/tmp.5iJb6CsDf8/E---3.1_20835.p',prove_right_identity) ).
cnf(c_0_5,plain,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[associativity1]) ).
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(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
c_0_5 ).
cnf(c_0_8,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_9,plain,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
c_0_6 ).
cnf(c_0_10,plain,
( product(X1,X2,X3)
| ~ product(X1,X4,identity)
| ~ product(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_12,plain,
( product(X1,X2,X3)
| ~ product(X4,identity,X1)
| ~ product(X4,X2,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_13,plain,
( product(inverse(X1),X2,X3)
| ~ product(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( product(X1,X2,X3)
| ~ product(inverse(X4),X2,X3)
| ~ product(X4,X1,identity) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( product(X1,X2,identity)
| ~ product(X2,X1,identity) ),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_16,plain,
product(X1,inverse(X1),identity),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
~ product(a,identity,a),
inference(fof_simplification,[status(thm)],[prove_right_identity]) ).
cnf(c_0_18,plain,
( product(X1,X2,X3)
| ~ product(inverse(X1),X3,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
~ product(a,identity,a),
c_0_17 ).
cnf(c_0_20,plain,
product(X1,identity,X1),
inference(spm,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : GRP003-2 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 16:20:52 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.5iJb6CsDf8/E---3.1_20835.p
% 62.27/31.54 # Version: 3.1.0
% 62.27/31.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 62.27/31.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 62.27/31.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 62.27/31.54 # Starting new_bool_3 with 300s (1) cores
% 62.27/31.54 # Starting new_bool_1 with 300s (1) cores
% 62.27/31.54 # Starting sh5l with 300s (1) cores
% 62.27/31.54 # sh5l with pid 20916 completed with status 0
% 62.27/31.54 # Result found by sh5l
% 62.27/31.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 62.27/31.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 62.27/31.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 62.27/31.54 # Starting new_bool_3 with 300s (1) cores
% 62.27/31.54 # Starting new_bool_1 with 300s (1) cores
% 62.27/31.54 # Starting sh5l with 300s (1) cores
% 62.27/31.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 62.27/31.54 # Search class: FHUNS-FFSF11-SFFFFFNN
% 62.27/31.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 62.27/31.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 62.27/31.54 # SAT001_MinMin_p005000_rr_RG with pid 20924 completed with status 0
% 62.27/31.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 62.27/31.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 62.27/31.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 62.27/31.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 62.27/31.54 # Starting new_bool_3 with 300s (1) cores
% 62.27/31.54 # Starting new_bool_1 with 300s (1) cores
% 62.27/31.54 # Starting sh5l with 300s (1) cores
% 62.27/31.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 62.27/31.54 # Search class: FHUNS-FFSF11-SFFFFFNN
% 62.27/31.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 62.27/31.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 62.27/31.54 # Preprocessing time : 0.001 s
% 62.27/31.54 # Presaturation interreduction done
% 62.27/31.54
% 62.27/31.54 # Proof found!
% 62.27/31.54 # SZS status Unsatisfiable
% 62.27/31.54 # SZS output start CNFRefutation
% See solution above
% 62.27/31.54 # Parsed axioms : 8
% 62.27/31.54 # Removed by relevancy pruning/SinE : 1
% 62.27/31.54 # Initial clauses : 7
% 62.27/31.54 # Removed in clause preprocessing : 0
% 62.27/31.54 # Initial clauses in saturation : 7
% 62.27/31.54 # Processed clauses : 274
% 62.27/31.54 # ...of these trivial : 8
% 62.27/31.54 # ...subsumed : 130
% 62.27/31.54 # ...remaining for further processing : 136
% 62.27/31.54 # Other redundant clauses eliminated : 0
% 62.27/31.54 # Clauses deleted for lack of memory : 0
% 62.27/31.54 # Backward-subsumed : 6
% 62.27/31.54 # Backward-rewritten : 3
% 62.27/31.54 # Generated clauses : 968
% 62.27/31.54 # ...of the previous two non-redundant : 638
% 62.27/31.54 # ...aggressively subsumed : 0
% 62.27/31.54 # Contextual simplify-reflections : 0
% 62.27/31.54 # Paramodulations : 968
% 62.27/31.54 # Factorizations : 0
% 62.27/31.54 # NegExts : 0
% 62.27/31.54 # Equation resolutions : 0
% 62.27/31.54 # Disequality decompositions : 0
% 62.27/31.54 # Total rewrite steps : 487
% 62.27/31.54 # ...of those cached : 463
% 62.27/31.54 # Propositional unsat checks : 0
% 62.27/31.54 # Propositional check models : 0
% 62.27/31.54 # Propositional check unsatisfiable : 0
% 62.27/31.54 # Propositional clauses : 0
% 62.27/31.54 # Propositional clauses after purity: 0
% 62.27/31.54 # Propositional unsat core size : 0
% 62.27/31.54 # Propositional preprocessing time : 0.000
% 62.27/31.54 # Propositional encoding time : 0.000
% 62.27/31.54 # Propositional solver time : 0.000
% 62.27/31.54 # Success case prop preproc time : 0.000
% 62.27/31.54 # Success case prop encoding time : 0.000
% 62.27/31.54 # Success case prop solver time : 0.000
% 62.27/31.54 # Current number of processed clauses : 120
% 62.27/31.54 # Positive orientable unit clauses : 17
% 62.27/31.54 # Positive unorientable unit clauses: 0
% 62.27/31.54 # Negative unit clauses : 0
% 62.27/31.54 # Non-unit-clauses : 103
% 62.27/31.54 # Current number of unprocessed clauses: 373
% 62.27/31.54 # ...number of literals in the above : 1003
% 62.27/31.54 # Current number of archived formulas : 0
% 62.27/31.54 # Current number of archived clauses : 16
% 62.27/31.54 # Clause-clause subsumption calls (NU) : 2465
% 62.27/31.54 # Rec. Clause-clause subsumption calls : 2259
% 62.27/31.54 # Non-unit clause-clause subsumptions : 136
% 62.27/31.54 # Unit Clause-clause subsumption calls : 73
% 62.27/31.54 # Rewrite failures with RHS unbound : 0
% 62.27/31.54 # BW rewrite match attempts : 72
% 62.27/31.54 # BW rewrite match successes : 3
% 62.27/31.54 # Condensation attempts : 0
% 62.27/31.54 # Condensation successes : 0
% 62.27/31.54 # Termbank termtop insertions : 10161
% 62.27/31.54 # Search garbage collected termcells : 27
% 62.27/31.54
% 62.27/31.54 # -------------------------------------------------
% 62.27/31.54 # User time : 0.011 s
% 62.27/31.54 # System time : 0.004 s
% 62.27/31.54 # Total time : 0.014 s
% 62.27/31.54 # Maximum resident set size: 1608 pages
% 62.27/31.54
% 62.27/31.54 # -------------------------------------------------
% 62.27/31.54 # User time : 0.012 s
% 62.27/31.54 # System time : 0.004 s
% 62.27/31.54 # Total time : 0.017 s
% 62.27/31.54 # Maximum resident set size: 1692 pages
% 62.27/31.54 % E---3.1 exiting
% 62.27/31.54 % E exiting
%------------------------------------------------------------------------------