TSTP Solution File: GRP031-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP031-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:11 EDT 2023
% Result : Unsatisfiable 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 37 ( 0 equ; 22 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 : 48 ( 2 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/tmp/tmp.EFpIxkgxOz/E---3.1_24116.p',associativity2) ).
cnf(right_inverse,hypothesis,
product(X1,inverse(X1),identity),
file('/export/starexec/sandbox2/tmp/tmp.EFpIxkgxOz/E---3.1_24116.p',right_inverse) ).
cnf(associativity1,axiom,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.EFpIxkgxOz/E---3.1_24116.p',associativity1) ).
cnf(right_identity,hypothesis,
product(X1,identity,X1),
file('/export/starexec/sandbox2/tmp/tmp.EFpIxkgxOz/E---3.1_24116.p',right_identity) ).
cnf(prove_a_has_a_left_inverse,negated_conjecture,
~ product(X1,a,identity),
file('/export/starexec/sandbox2/tmp/tmp.EFpIxkgxOz/E---3.1_24116.p',prove_a_has_a_left_inverse) ).
cnf(c_0_5,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
associativity2 ).
cnf(c_0_6,hypothesis,
product(X1,inverse(X1),identity),
right_inverse ).
cnf(c_0_7,axiom,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
associativity1 ).
cnf(c_0_8,hypothesis,
( product(X1,inverse(X2),X3)
| ~ product(X4,identity,X3)
| ~ product(X4,X2,X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,hypothesis,
product(X1,identity,X1),
right_identity ).
cnf(c_0_10,hypothesis,
( product(X1,X2,identity)
| ~ product(X3,inverse(X4),X2)
| ~ product(X1,X3,X4) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_11,hypothesis,
( product(X1,inverse(X2),X3)
| ~ product(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,hypothesis,
( product(X1,X2,identity)
| ~ product(X1,X3,X4)
| ~ product(X2,X4,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,hypothesis,
( product(X1,X2,identity)
| ~ product(X2,X1,identity) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
~ product(X1,a,identity),
prove_a_has_a_left_inverse ).
cnf(c_0_15,hypothesis,
product(inverse(X1),X1,identity),
inference(spm,[status(thm)],[c_0_13,c_0_6]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_14,c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : GRP031-2 : TPTP v8.1.2. Released v1.0.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n026.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 : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 03:19:14 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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/tmp/tmp.EFpIxkgxOz/E---3.1_24116.p
% 0.15/0.41 # Version: 3.1pre001
% 0.15/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # Starting sh5l with 300s (1) cores
% 0.15/0.41 # new_bool_3 with pid 24195 completed with status 0
% 0.15/0.41 # Result found by new_bool_3
% 0.15/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FHUNS-FFSF11-SFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.41 # SAT001_MinMin_p005000_rr_RG with pid 24199 completed with status 0
% 0.15/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FHUNS-FFSF11-SFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41 # Presaturation interreduction done
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Unsatisfiable
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.41 # Parsed axioms : 7
% 0.15/0.41 # Removed by relevancy pruning/SinE : 2
% 0.15/0.41 # Initial clauses : 5
% 0.15/0.41 # Removed in clause preprocessing : 0
% 0.15/0.41 # Initial clauses in saturation : 5
% 0.15/0.41 # Processed clauses : 29
% 0.15/0.41 # ...of these trivial : 0
% 0.15/0.41 # ...subsumed : 2
% 0.15/0.41 # ...remaining for further processing : 27
% 0.15/0.41 # Other redundant clauses eliminated : 0
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 0
% 0.15/0.41 # Backward-rewritten : 1
% 0.15/0.41 # Generated clauses : 63
% 0.15/0.41 # ...of the previous two non-redundant : 37
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 0
% 0.15/0.41 # Paramodulations : 63
% 0.15/0.41 # Factorizations : 0
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 0
% 0.15/0.41 # Total rewrite steps : 12
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 21
% 0.15/0.41 # Positive orientable unit clauses : 4
% 0.15/0.41 # Positive unorientable unit clauses: 0
% 0.15/0.41 # Negative unit clauses : 1
% 0.15/0.41 # Non-unit-clauses : 16
% 0.15/0.41 # Current number of unprocessed clauses: 18
% 0.15/0.41 # ...number of literals in the above : 47
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 6
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 40
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 33
% 0.15/0.41 # Non-unit clause-clause subsumptions : 2
% 0.15/0.41 # Unit Clause-clause subsumption calls : 0
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 2
% 0.15/0.41 # BW rewrite match successes : 1
% 0.15/0.41 # Condensation attempts : 0
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 848
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.004 s
% 0.15/0.41 # System time : 0.000 s
% 0.15/0.41 # Total time : 0.004 s
% 0.15/0.41 # Maximum resident set size: 1648 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.005 s
% 0.15/0.41 # System time : 0.001 s
% 0.15/0.41 # Total time : 0.006 s
% 0.15/0.41 # Maximum resident set size: 1676 pages
% 0.15/0.41 % E---3.1 exiting
% 0.15/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------