TSTP Solution File: GRP544-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP544-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:42:05 EDT 2023
% Result : Timeout 408.37s 300.13s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 3 RR)
% Number of literals : 19 ( 18 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(identity,divide(divide(divide(X1,X2),X3),X1)),X3) = X2,
file('/export/starexec/sandbox/tmp/tmp.Lz42NT0kTe/E---3.1_17855.p',single_axiom) ).
cnf(identity,axiom,
identity = divide(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.Lz42NT0kTe/E---3.1_17855.p',identity) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
file('/export/starexec/sandbox/tmp/tmp.Lz42NT0kTe/E---3.1_17855.p',multiply) ).
cnf(prove_these_axioms_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox/tmp/tmp.Lz42NT0kTe/E---3.1_17855.p',prove_these_axioms_4) ).
cnf(c_0_4,axiom,
divide(divide(identity,divide(divide(divide(X1,X2),X3),X1)),X3) = X2,
single_axiom ).
cnf(c_0_5,axiom,
identity = divide(X1,X1),
identity ).
cnf(c_0_6,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
multiply ).
cnf(c_0_7,plain,
divide(multiply(identity,X1),divide(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
cnf(c_0_8,plain,
multiply(X1,identity) = divide(X1,identity),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_9,plain,
multiply(identity,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_5]) ).
cnf(c_0_10,plain,
divide(X1,divide(X1,X2)) = X2,
inference(rw,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_11,plain,
divide(X1,identity) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_12,plain,
divide(identity,divide(divide(X1,X2),X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_11]),c_0_11]) ).
cnf(c_0_13,plain,
divide(divide(X1,X2),X1) = divide(identity,X2),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_14,plain,
multiply(divide(X1,X2),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_13]),c_0_6]) ).
cnf(c_0_15,plain,
divide(multiply(X1,X2),X1) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_6]),c_0_10]) ).
cnf(c_0_16,negated_conjecture,
multiply(a,b) != multiply(b,a),
prove_these_axioms_4 ).
cnf(c_0_17,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP544-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n004.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 02:17:29 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.Lz42NT0kTe/E---3.1_17855.p
% 408.37/300.13 # Version: 3.1pre001
% 408.37/300.13 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.37/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.37/300.13 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.37/300.13 # Starting new_bool_3 with 300s (1) cores
% 408.37/300.13 # Starting new_bool_1 with 300s (1) cores
% 408.37/300.13 # Starting sh5l with 300s (1) cores
% 408.37/300.13 # new_bool_3 with pid 17936 completed with status 0
% 408.37/300.13 # Result found by new_bool_3
% 408.37/300.13 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.37/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.37/300.13 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.37/300.13 # Starting new_bool_3 with 300s (1) cores
% 408.37/300.13 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.37/300.13 # Search class: FUUPS-FFSF22-MFFFFFNN
% 408.37/300.13 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.37/300.13 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 408.37/300.13 # G-E--_208_C18_F1_AE_CS_SP_S0Y with pid 17940 completed with status 0
% 408.37/300.13 # Result found by G-E--_208_C18_F1_AE_CS_SP_S0Y
% 408.37/300.13 # Preprocessing class: FSSSSMSSSSSNFFN.
% 408.37/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.37/300.13 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 408.37/300.13 # Starting new_bool_3 with 300s (1) cores
% 408.37/300.13 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.37/300.13 # Search class: FUUPS-FFSF22-MFFFFFNN
% 408.37/300.13 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.37/300.13 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 408.37/300.13 # Preprocessing time : 0.001 s
% 408.37/300.13
% 408.37/300.13 # Proof found!
% 408.37/300.13 # SZS status Unsatisfiable
% 408.37/300.13 # SZS output start CNFRefutation
% See solution above
% 408.37/300.13 # Parsed axioms : 5
% 408.37/300.13 # Removed by relevancy pruning/SinE : 1
% 408.37/300.13 # Initial clauses : 4
% 408.37/300.13 # Removed in clause preprocessing : 0
% 408.37/300.13 # Initial clauses in saturation : 4
% 408.37/300.13 # Processed clauses : 23
% 408.37/300.13 # ...of these trivial : 3
% 408.37/300.13 # ...subsumed : 0
% 408.37/300.13 # ...remaining for further processing : 20
% 408.37/300.13 # Other redundant clauses eliminated : 0
% 408.37/300.13 # Clauses deleted for lack of memory : 0
% 408.37/300.13 # Backward-subsumed : 0
% 408.37/300.13 # Backward-rewritten : 8
% 408.37/300.13 # Generated clauses : 116
% 408.37/300.13 # ...of the previous two non-redundant : 70
% 408.37/300.13 # ...aggressively subsumed : 0
% 408.37/300.13 # Contextual simplify-reflections : 0
% 408.37/300.13 # Paramodulations : 116
% 408.37/300.13 # Factorizations : 0
% 408.37/300.13 # NegExts : 0
% 408.37/300.13 # Equation resolutions : 0
% 408.37/300.13 # Total rewrite steps : 102
% 408.37/300.13 # Propositional unsat checks : 0
% 408.37/300.13 # Propositional check models : 0
% 408.37/300.13 # Propositional check unsatisfiable : 0
% 408.37/300.13 # Propositional clauses : 0
% 408.37/300.13 # Propositional clauses after purity: 0
% 408.37/300.13 # Propositional unsat core size : 0
% 408.37/300.13 # Propositional preprocessing time : 0.000
% 408.37/300.13 # Propositional encoding time : 0.000
% 408.37/300.13 # Propositional solver time : 0.000
% 408.37/300.13 # Success case prop preproc time : 0.000
% 408.37/300.13 # Success case prop encoding time : 0.000
% 408.37/300.13 # Success case prop solver time : 0.000
% 408.37/300.13 # Current number of processed clauses : 12
% 408.37/300.13 # Positive orientable unit clauses : 11
% 408.37/300.13 # Positive unorientable unit clauses: 1
% 408.37/300.13 # Negative unit clauses : 0
% 408.37/300.13 # Non-unit-clauses : 0
% 408.37/300.13 # Current number of unprocessed clauses: 48
% 408.37/300.13 # ...number of literals in the above : 48
% 408.37/300.13 # Current number of archived formulas : 0
% 408.37/300.13 # Current number of archived clauses : 8
% 408.37/300.13 # Clause-clause subsumption calls (NU) : 0
% 408.37/300.13 # Rec. Clause-clause subsumption calls : 0
% 408.37/300.13 # Non-unit clause-clause subsumptions : 0
% 408.37/300.13 # Unit Clause-clause subsumption calls : 0
% 408.37/300.13 # Rewrite failures with RHS unbound : 0
% 408.37/300.13 # BW rewrite match attempts : 23
% 408.37/300.13 # BW rewrite match successes : 19
% 408.37/300.13 # Condensation attempts : 0
% 408.37/300.13 # Condensation successes : 0
% 408.37/300.13 # Termbank termtop insertions : 822
% 408.37/300.13
% 408.37/300.13 # -------------------------------------------------
% 408.37/300.13 # User time : 0.001 s
% 408.37/300.13 # System time : 0.003 s
% 408.37/300.13 # Total time : 0.004 s
% 408.37/300.13 # Maximum resident set size: 1424 pages
% 408.37/300.13
% 408.37/300.13 # -------------------------------------------------
% 408.37/300.13 # User time : 0.002 s
% 408.37/300.13 # System time : 0.005 s
% 408.37/300.13 # Total time : 0.007 s
% 408.37/300.13 # Maximum resident set size: 1672 pages
% 408.37/300.13 % E---3.1 exiting
% 408.37/300.13 % E---3.1 exiting
%------------------------------------------------------------------------------