TSTP Solution File: GRP001-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP001-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:24 EDT 2023
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 13 unt; 0 nHn; 15 RR)
% Number of literals : 39 ( 0 equ; 20 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 44 ( 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.260S4A8vjf/E---3.1_31241.p',associativity2) ).
cnf(square_element,hypothesis,
product(X1,X1,identity),
file('/export/starexec/sandbox/tmp/tmp.260S4A8vjf/E---3.1_31241.p',square_element) ).
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.260S4A8vjf/E---3.1_31241.p',associativity1) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox/tmp/tmp.260S4A8vjf/E---3.1_31241.p',left_identity) ).
cnf(right_identity,axiom,
product(X1,identity,X1),
file('/export/starexec/sandbox/tmp/tmp.260S4A8vjf/E---3.1_31241.p',right_identity) ).
cnf(a_times_b_is_c,negated_conjecture,
product(a,b,c),
file('/export/starexec/sandbox/tmp/tmp.260S4A8vjf/E---3.1_31241.p',a_times_b_is_c) ).
cnf(prove_b_times_a_is_c,negated_conjecture,
~ product(b,a,c),
file('/export/starexec/sandbox/tmp/tmp.260S4A8vjf/E---3.1_31241.p',prove_b_times_a_is_c) ).
cnf(c_0_7,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
associativity2 ).
cnf(c_0_8,hypothesis,
product(X1,X1,identity),
square_element ).
cnf(c_0_9,axiom,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
associativity1 ).
cnf(c_0_10,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_11,hypothesis,
( product(X1,X2,X3)
| ~ product(X4,identity,X3)
| ~ product(X4,X2,X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,axiom,
product(X1,identity,X1),
right_identity ).
cnf(c_0_13,plain,
( product(X1,X2,X3)
| ~ product(X1,X4,identity)
| ~ product(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,hypothesis,
( product(X1,X2,X3)
| ~ product(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
product(a,b,c),
a_times_b_is_c ).
cnf(c_0_16,hypothesis,
( product(X1,X2,X3)
| ~ product(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_17,negated_conjecture,
product(c,b,a),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
product(c,a,b),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
~ product(b,a,c),
prove_b_times_a_is_c ).
cnf(c_0_20,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 03:06:22 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.260S4A8vjf/E---3.1_31241.p
% 0.20/0.49 # Version: 3.1pre001
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 # new_bool_3 with pid 31339 completed with status 0
% 0.20/0.49 # Result found by new_bool_3
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FHUSS-FFSF00-SFFFFFNN
% 0.20/0.49 # partial match(1): FHUNS-FFSF00-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 31344 completed with status 0
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FHUSS-FFSF00-SFFFFFNN
% 0.20/0.49 # partial match(1): FHUNS-FFSF00-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 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 : 11
% 0.20/0.49 # Removed by relevancy pruning/SinE : 3
% 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 : 45
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 3
% 0.20/0.49 # ...remaining for further processing : 42
% 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 : 2
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 81
% 0.20/0.49 # ...of the previous two non-redundant : 58
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 81
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Total rewrite steps : 19
% 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 : 32
% 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 : 1
% 0.20/0.49 # Non-unit-clauses : 25
% 0.20/0.49 # Current number of unprocessed clauses: 25
% 0.20/0.49 # ...number of literals in the above : 67
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 10
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 202
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 188
% 0.20/0.49 # Non-unit clause-clause subsumptions : 5
% 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 : 5
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1053
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.000 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1652 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.007 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1676 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------