TSTP Solution File: GRP029-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP029-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:32 EDT 2023
% Result : Unsatisfiable 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 12 unt; 0 nHn; 16 RR)
% Number of literals : 47 ( 0 equ; 24 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 60 ( 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/sandbox2/tmp/tmp.rdGw6uUpeI/E---3.1_22115.p',associativity1) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.rdGw6uUpeI/E---3.1_22115.p',left_identity) ).
cnf(total_function2,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.rdGw6uUpeI/E---3.1_22115.p',total_function2) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox2/tmp/tmp.rdGw6uUpeI/E---3.1_22115.p',left_inverse) ).
cnf(product_substitution3,axiom,
( product(X3,X4,X2)
| ~ equalish(X1,X2)
| ~ product(X3,X4,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.rdGw6uUpeI/E---3.1_22115.p',product_substitution3) ).
cnf(total_function1,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.rdGw6uUpeI/E---3.1_22115.p',total_function1) ).
cnf(prove_there_is_a_right_identity,negated_conjecture,
~ product(not_right_identity(X1),X1,not_right_identity(X1)),
file('/export/starexec/sandbox2/tmp/tmp.rdGw6uUpeI/E---3.1_22115.p',prove_there_is_a_right_identity) ).
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,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_9,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
total_function2 ).
cnf(c_0_10,axiom,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_11,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_12,plain,
( equalish(X1,identity)
| ~ product(inverse(X2),X2,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( product(inverse(X1),X2,X3)
| ~ product(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_14,plain,
( equalish(X1,identity)
| ~ product(X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
( product(X3,X4,X2)
| ~ equalish(X1,X2)
| ~ product(X3,X4,X1) ),
product_substitution3 ).
cnf(c_0_16,axiom,
product(X1,X2,multiply(X1,X2)),
total_function1 ).
cnf(c_0_17,plain,
( equalish(X1,identity)
| ~ product(X2,inverse(X2),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_18,plain,
( product(X1,X2,X3)
| ~ equalish(multiply(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
equalish(multiply(X1,inverse(X1)),identity),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_20,plain,
product(X1,inverse(X1),identity),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
( product(X1,X2,X3)
| ~ product(inverse(X1),X3,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
~ product(not_right_identity(X1),X1,not_right_identity(X1)),
prove_there_is_a_right_identity ).
cnf(c_0_23,plain,
product(X1,identity,X1),
inference(spm,[status(thm)],[c_0_21,c_0_10]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_22,c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP029-2 : TPTP v8.1.2. Released v1.0.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 02:41:19 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.rdGw6uUpeI/E---3.1_22115.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22192 completed with status 0
% 0.17/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FHUNM-FFSF21-SFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.46 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.46 # Starting sh5l with 136s (1) cores
% 0.17/0.46 # SAT001_MinMin_p005000_rr_RG with pid 22197 completed with status 0
% 0.17/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FHUNM-FFSF21-SFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Unsatisfiable
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 16
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 16
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 16
% 0.17/0.46 # Processed clauses : 274
% 0.17/0.46 # ...of these trivial : 19
% 0.17/0.46 # ...subsumed : 80
% 0.17/0.46 # ...remaining for further processing : 175
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 2
% 0.17/0.46 # Backward-rewritten : 1
% 0.17/0.46 # Generated clauses : 1273
% 0.17/0.46 # ...of the previous two non-redundant : 985
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 1273
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Total rewrite steps : 297
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 156
% 0.17/0.46 # Positive orientable unit clauses : 29
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 1
% 0.17/0.46 # Non-unit-clauses : 126
% 0.17/0.46 # Current number of unprocessed clauses: 743
% 0.17/0.46 # ...number of literals in the above : 1680
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 19
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 2828
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 2356
% 0.17/0.46 # Non-unit clause-clause subsumptions : 82
% 0.17/0.46 # Unit Clause-clause subsumption calls : 33
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 37
% 0.17/0.46 # BW rewrite match successes : 1
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 12236
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.016 s
% 0.17/0.46 # System time : 0.003 s
% 0.17/0.46 # Total time : 0.019 s
% 0.17/0.46 # Maximum resident set size: 1612 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.086 s
% 0.17/0.46 # System time : 0.006 s
% 0.17/0.46 # Total time : 0.092 s
% 0.17/0.46 # Maximum resident set size: 1684 pages
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------