TSTP Solution File: GRP564-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP564-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:01:00 EDT 2024
% Result : Unsatisfiable 0.10s 0.34s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 5 RR)
% Number of literals : 23 ( 22 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(divide(X1,inverse(X2)),X3),divide(X1,X3)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.0sO7O2jy8z/E---3.1_6736.p',single_axiom) ).
cnf(prove_these_axioms_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/tmp/tmp.0sO7O2jy8z/E---3.1_6736.p',prove_these_axioms_4) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox2/tmp/tmp.0sO7O2jy8z/E---3.1_6736.p',multiply) ).
cnf(c_0_3,axiom,
divide(divide(divide(X1,inverse(X2)),X3),divide(X1,X3)) = X2,
single_axiom ).
cnf(c_0_4,plain,
divide(divide(divide(divide(divide(X1,inverse(X2)),X3),inverse(X4)),divide(X1,X3)),X2) = X4,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
divide(divide(X1,inverse(X2)),X1) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_4]),c_0_3]) ).
cnf(c_0_6,plain,
divide(X1,divide(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
divide(X1,divide(divide(X2,inverse(X1)),divide(X2,inverse(X3)))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_8,plain,
divide(divide(X1,X1),inverse(X2)) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
divide(X1,divide(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_10,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_12,plain,
divide(divide(X1,X2),X1) = inverse(X2),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_13,plain,
divide(X1,X1) = divide(X2,X2),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_14,negated_conjecture,
multiply(a,b) != multiply(b,a),
inference(fof_simplification,[status(thm)],[prove_these_axioms_4]) ).
cnf(c_0_15,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_16,plain,
divide(divide(X1,inverse(X2)),X2) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_13]),c_0_8]),c_0_9]) ).
cnf(c_0_17,negated_conjecture,
multiply(a,b) != multiply(b,a),
c_0_14 ).
cnf(c_0_18,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_19,plain,
divide(X1,divide(X2,inverse(X1))) = inverse(X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
divide(a,inverse(b)) != divide(b,inverse(a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
cnf(c_0_21,plain,
divide(X1,inverse(X2)) = divide(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_7,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : GRP564-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.00/0.07 % Command : run_E %s %d THM
% 0.06/0.26 % Computer : n032.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 300
% 0.06/0.26 % DateTime : Fri May 3 16:26:52 EDT 2024
% 0.06/0.26 % CPUTime :
% 0.10/0.33 Running first-order model finding
% 0.10/0.33 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.0sO7O2jy8z/E---3.1_6736.p
% 0.10/0.34 # Version: 3.1.0
% 0.10/0.34 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.34 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.34 # Starting new_bool_3 with 300s (1) cores
% 0.10/0.34 # Starting new_bool_1 with 300s (1) cores
% 0.10/0.34 # Starting sh5l with 300s (1) cores
% 0.10/0.34 # new_bool_3 with pid 6814 completed with status 0
% 0.10/0.34 # Result found by new_bool_3
% 0.10/0.34 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.34 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.34 # Starting new_bool_3 with 300s (1) cores
% 0.10/0.34 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.34 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.10/0.34 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.34 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.10/0.34 # U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 6817 completed with status 0
% 0.10/0.34 # Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.34 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.34 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.34 # Starting new_bool_3 with 300s (1) cores
% 0.10/0.34 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.34 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.10/0.34 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.34 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.10/0.34 # Preprocessing time : 0.001 s
% 0.10/0.34 # Presaturation interreduction done
% 0.10/0.34
% 0.10/0.34 # Proof found!
% 0.10/0.34 # SZS status Unsatisfiable
% 0.10/0.34 # SZS output start CNFRefutation
% See solution above
% 0.10/0.34 # Parsed axioms : 3
% 0.10/0.34 # Removed by relevancy pruning/SinE : 0
% 0.10/0.34 # Initial clauses : 3
% 0.10/0.34 # Removed in clause preprocessing : 0
% 0.10/0.34 # Initial clauses in saturation : 3
% 0.10/0.34 # Processed clauses : 72
% 0.10/0.34 # ...of these trivial : 19
% 0.10/0.34 # ...subsumed : 25
% 0.10/0.34 # ...remaining for further processing : 28
% 0.10/0.34 # Other redundant clauses eliminated : 0
% 0.10/0.34 # Clauses deleted for lack of memory : 0
% 0.10/0.34 # Backward-subsumed : 0
% 0.10/0.34 # Backward-rewritten : 11
% 0.10/0.34 # Generated clauses : 510
% 0.10/0.34 # ...of the previous two non-redundant : 353
% 0.10/0.34 # ...aggressively subsumed : 0
% 0.10/0.34 # Contextual simplify-reflections : 0
% 0.10/0.34 # Paramodulations : 510
% 0.10/0.34 # Factorizations : 0
% 0.10/0.34 # NegExts : 0
% 0.10/0.34 # Equation resolutions : 0
% 0.10/0.34 # Disequality decompositions : 0
% 0.10/0.34 # Total rewrite steps : 484
% 0.10/0.34 # ...of those cached : 331
% 0.10/0.34 # Propositional unsat checks : 0
% 0.10/0.34 # Propositional check models : 0
% 0.10/0.34 # Propositional check unsatisfiable : 0
% 0.10/0.34 # Propositional clauses : 0
% 0.10/0.34 # Propositional clauses after purity: 0
% 0.10/0.34 # Propositional unsat core size : 0
% 0.10/0.34 # Propositional preprocessing time : 0.000
% 0.10/0.34 # Propositional encoding time : 0.000
% 0.10/0.34 # Propositional solver time : 0.000
% 0.10/0.34 # Success case prop preproc time : 0.000
% 0.10/0.34 # Success case prop encoding time : 0.000
% 0.10/0.34 # Success case prop solver time : 0.000
% 0.10/0.34 # Current number of processed clauses : 14
% 0.10/0.34 # Positive orientable unit clauses : 10
% 0.10/0.34 # Positive unorientable unit clauses: 4
% 0.10/0.34 # Negative unit clauses : 0
% 0.10/0.34 # Non-unit-clauses : 0
% 0.10/0.34 # Current number of unprocessed clauses: 261
% 0.10/0.34 # ...number of literals in the above : 261
% 0.10/0.34 # Current number of archived formulas : 0
% 0.10/0.34 # Current number of archived clauses : 14
% 0.10/0.34 # Clause-clause subsumption calls (NU) : 0
% 0.10/0.34 # Rec. Clause-clause subsumption calls : 0
% 0.10/0.34 # Non-unit clause-clause subsumptions : 0
% 0.10/0.34 # Unit Clause-clause subsumption calls : 31
% 0.10/0.34 # Rewrite failures with RHS unbound : 0
% 0.10/0.34 # BW rewrite match attempts : 130
% 0.10/0.34 # BW rewrite match successes : 52
% 0.10/0.34 # Condensation attempts : 0
% 0.10/0.34 # Condensation successes : 0
% 0.10/0.34 # Termbank termtop insertions : 4364
% 0.10/0.34 # Search garbage collected termcells : 2
% 0.10/0.34
% 0.10/0.34 # -------------------------------------------------
% 0.10/0.34 # User time : 0.004 s
% 0.10/0.34 # System time : 0.001 s
% 0.10/0.34 # Total time : 0.005 s
% 0.10/0.34 # Maximum resident set size: 1616 pages
% 0.10/0.34
% 0.10/0.34 # -------------------------------------------------
% 0.10/0.34 # User time : 0.005 s
% 0.10/0.34 # System time : 0.002 s
% 0.10/0.34 # Total time : 0.007 s
% 0.10/0.34 # Maximum resident set size: 1688 pages
% 0.10/0.34 % E---3.1 exiting
%------------------------------------------------------------------------------