TSTP Solution File: GRP544-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n021.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:49:25 EDT 2023
% Result : Unsatisfiable 0.23s 0.54s
% Output : CNFRefutation 0.23s
% 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/sandbox2/tmp/tmp.I9ezFOJ8Vu/E---3.1_24636.p',single_axiom) ).
cnf(identity,axiom,
identity = divide(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.I9ezFOJ8Vu/E---3.1_24636.p',identity) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
file('/export/starexec/sandbox2/tmp/tmp.I9ezFOJ8Vu/E---3.1_24636.p',multiply) ).
cnf(prove_these_axioms_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/tmp/tmp.I9ezFOJ8Vu/E---3.1_24636.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.08/0.15 % Problem : GRP544-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.08/0.16 % Command : run_E %s %d THM
% 0.14/0.38 % Computer : n021.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8042.1875MB
% 0.14/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.38 % CPULimit : 2400
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Tue Oct 3 02:24:14 EDT 2023
% 0.14/0.38 % CPUTime :
% 0.23/0.53 Running first-order model finding
% 0.23/0.53 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.I9ezFOJ8Vu/E---3.1_24636.p
% 0.23/0.54 # Version: 3.1pre001
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # new_bool_1 with pid 24715 completed with status 0
% 0.23/0.54 # Result found by new_bool_1
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.54 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.23/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 0.23/0.54 # G-E--_208_C18_F1_AE_CS_SP_S0Y with pid 24718 completed with status 0
% 0.23/0.54 # Result found by G-E--_208_C18_F1_AE_CS_SP_S0Y
% 0.23/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.54 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.23/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 0.23/0.54 # Preprocessing time : 0.001 s
% 0.23/0.54
% 0.23/0.54 # Proof found!
% 0.23/0.54 # SZS status Unsatisfiable
% 0.23/0.54 # SZS output start CNFRefutation
% See solution above
% 0.23/0.54 # Parsed axioms : 5
% 0.23/0.54 # Removed by relevancy pruning/SinE : 1
% 0.23/0.54 # Initial clauses : 4
% 0.23/0.54 # Removed in clause preprocessing : 0
% 0.23/0.54 # Initial clauses in saturation : 4
% 0.23/0.54 # Processed clauses : 23
% 0.23/0.54 # ...of these trivial : 3
% 0.23/0.54 # ...subsumed : 0
% 0.23/0.54 # ...remaining for further processing : 20
% 0.23/0.54 # Other redundant clauses eliminated : 0
% 0.23/0.54 # Clauses deleted for lack of memory : 0
% 0.23/0.54 # Backward-subsumed : 0
% 0.23/0.54 # Backward-rewritten : 8
% 0.23/0.54 # Generated clauses : 116
% 0.23/0.54 # ...of the previous two non-redundant : 70
% 0.23/0.54 # ...aggressively subsumed : 0
% 0.23/0.54 # Contextual simplify-reflections : 0
% 0.23/0.54 # Paramodulations : 116
% 0.23/0.54 # Factorizations : 0
% 0.23/0.54 # NegExts : 0
% 0.23/0.54 # Equation resolutions : 0
% 0.23/0.54 # Total rewrite steps : 102
% 0.23/0.54 # Propositional unsat checks : 0
% 0.23/0.54 # Propositional check models : 0
% 0.23/0.54 # Propositional check unsatisfiable : 0
% 0.23/0.54 # Propositional clauses : 0
% 0.23/0.54 # Propositional clauses after purity: 0
% 0.23/0.54 # Propositional unsat core size : 0
% 0.23/0.54 # Propositional preprocessing time : 0.000
% 0.23/0.54 # Propositional encoding time : 0.000
% 0.23/0.54 # Propositional solver time : 0.000
% 0.23/0.54 # Success case prop preproc time : 0.000
% 0.23/0.54 # Success case prop encoding time : 0.000
% 0.23/0.54 # Success case prop solver time : 0.000
% 0.23/0.54 # Current number of processed clauses : 12
% 0.23/0.54 # Positive orientable unit clauses : 11
% 0.23/0.54 # Positive unorientable unit clauses: 1
% 0.23/0.54 # Negative unit clauses : 0
% 0.23/0.54 # Non-unit-clauses : 0
% 0.23/0.54 # Current number of unprocessed clauses: 48
% 0.23/0.54 # ...number of literals in the above : 48
% 0.23/0.54 # Current number of archived formulas : 0
% 0.23/0.54 # Current number of archived clauses : 8
% 0.23/0.54 # Clause-clause subsumption calls (NU) : 0
% 0.23/0.54 # Rec. Clause-clause subsumption calls : 0
% 0.23/0.54 # Non-unit clause-clause subsumptions : 0
% 0.23/0.54 # Unit Clause-clause subsumption calls : 0
% 0.23/0.54 # Rewrite failures with RHS unbound : 0
% 0.23/0.54 # BW rewrite match attempts : 23
% 0.23/0.54 # BW rewrite match successes : 19
% 0.23/0.54 # Condensation attempts : 0
% 0.23/0.54 # Condensation successes : 0
% 0.23/0.54 # Termbank termtop insertions : 822
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.002 s
% 0.23/0.54 # System time : 0.002 s
% 0.23/0.54 # Total time : 0.004 s
% 0.23/0.54 # Maximum resident set size: 1428 pages
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.003 s
% 0.23/0.54 # System time : 0.004 s
% 0.23/0.54 # Total time : 0.007 s
% 0.23/0.54 # Maximum resident set size: 1676 pages
% 0.23/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------