TSTP Solution File: GRP523-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP523-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:21 EDT 2023
% Result : Unsatisfiable 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 4 RR)
% Number of literals : 26 ( 25 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 61 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
file('/export/starexec/sandbox/tmp/tmp.Gkh9Kk0YnO/E---3.1_26951.p',multiply) ).
cnf(single_axiom,axiom,
divide(X1,divide(X2,divide(X3,divide(X1,X2)))) = X3,
file('/export/starexec/sandbox/tmp/tmp.Gkh9Kk0YnO/E---3.1_26951.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/tmp/tmp.Gkh9Kk0YnO/E---3.1_26951.p',prove_these_axioms_3) ).
cnf(c_0_3,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
multiply ).
cnf(c_0_4,axiom,
divide(X1,divide(X2,divide(X3,divide(X1,X2)))) = X3,
single_axiom ).
cnf(c_0_5,plain,
multiply(X1,divide(X2,divide(X1,divide(X3,X3)))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
multiply(X1,divide(X2,multiply(X3,X2))) = divide(X1,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_3]) ).
cnf(c_0_7,plain,
multiply(X1,divide(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_8,plain,
divide(multiply(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
multiply(divide(X1,X2),X3) = divide(X1,divide(X2,X3)),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,plain,
divide(multiply(X1,X2),divide(X1,X3)) = multiply(X2,X3),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,plain,
multiply(X1,multiply(X2,divide(X3,X3))) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_12,plain,
multiply(X1,divide(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_11]),c_0_8]) ).
cnf(c_0_13,plain,
divide(X1,divide(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_12]) ).
cnf(c_0_14,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_15,plain,
divide(X1,divide(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_13]),c_0_9]) ).
cnf(c_0_16,plain,
multiply(X1,divide(X2,X3)) = divide(X2,divide(X3,X1)),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_17,plain,
divide(multiply(X1,X2),X3) = divide(X1,divide(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_16]) ).
cnf(c_0_18,plain,
divide(X1,divide(divide(divide(X2,X2),X3),X4)) = multiply(multiply(X1,X3),X4),
inference(spm,[status(thm)],[c_0_9,c_0_3]) ).
cnf(c_0_19,plain,
divide(X1,divide(X2,X3)) = divide(X3,divide(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14]),c_0_17]) ).
cnf(c_0_20,plain,
multiply(multiply(X1,X2),X3) = multiply(multiply(X3,X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
prove_these_axioms_3 ).
cnf(c_0_22,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X3,X2)),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_24,plain,
multiply(X1,multiply(X2,X3)) = multiply(X2,multiply(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_22]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : GRP523-1 : TPTP v8.1.2. Released v2.6.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n010.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 02:46:50 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 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.Gkh9Kk0YnO/E---3.1_26951.p
% 0.14/0.42 # Version: 3.1pre001
% 0.14/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 # Starting sh5l with 300s (1) cores
% 0.14/0.42 # new_bool_1 with pid 27030 completed with status 0
% 0.14/0.42 # Result found by new_bool_1
% 0.14/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.42 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.14/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.42 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 0.14/0.42 # G-E--_208_C18_F1_AE_CS_SP_S0Y with pid 27035 completed with status 0
% 0.14/0.42 # Result found by G-E--_208_C18_F1_AE_CS_SP_S0Y
% 0.14/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.42 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.14/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.42 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 0.14/0.42 # Preprocessing time : 0.001 s
% 0.14/0.42
% 0.14/0.42 # Proof found!
% 0.14/0.42 # SZS status Unsatisfiable
% 0.14/0.42 # SZS output start CNFRefutation
% See solution above
% 0.14/0.42 # Parsed axioms : 4
% 0.14/0.42 # Removed by relevancy pruning/SinE : 1
% 0.14/0.42 # Initial clauses : 3
% 0.14/0.42 # Removed in clause preprocessing : 0
% 0.14/0.42 # Initial clauses in saturation : 3
% 0.14/0.42 # Processed clauses : 179
% 0.14/0.42 # ...of these trivial : 45
% 0.14/0.42 # ...subsumed : 92
% 0.14/0.42 # ...remaining for further processing : 42
% 0.14/0.42 # Other redundant clauses eliminated : 0
% 0.14/0.42 # Clauses deleted for lack of memory : 0
% 0.14/0.42 # Backward-subsumed : 0
% 0.14/0.42 # Backward-rewritten : 21
% 0.14/0.42 # Generated clauses : 1416
% 0.14/0.42 # ...of the previous two non-redundant : 906
% 0.14/0.42 # ...aggressively subsumed : 0
% 0.14/0.42 # Contextual simplify-reflections : 0
% 0.14/0.42 # Paramodulations : 1416
% 0.14/0.42 # Factorizations : 0
% 0.14/0.42 # NegExts : 0
% 0.14/0.42 # Equation resolutions : 0
% 0.14/0.42 # Total rewrite steps : 1996
% 0.14/0.42 # Propositional unsat checks : 0
% 0.14/0.42 # Propositional check models : 0
% 0.14/0.42 # Propositional check unsatisfiable : 0
% 0.14/0.42 # Propositional clauses : 0
% 0.14/0.42 # Propositional clauses after purity: 0
% 0.14/0.42 # Propositional unsat core size : 0
% 0.14/0.42 # Propositional preprocessing time : 0.000
% 0.14/0.42 # Propositional encoding time : 0.000
% 0.14/0.42 # Propositional solver time : 0.000
% 0.14/0.42 # Success case prop preproc time : 0.000
% 0.14/0.42 # Success case prop encoding time : 0.000
% 0.14/0.42 # Success case prop solver time : 0.000
% 0.14/0.42 # Current number of processed clauses : 21
% 0.14/0.42 # Positive orientable unit clauses : 15
% 0.14/0.42 # Positive unorientable unit clauses: 6
% 0.14/0.42 # Negative unit clauses : 0
% 0.14/0.42 # Non-unit-clauses : 0
% 0.14/0.42 # Current number of unprocessed clauses: 515
% 0.14/0.42 # ...number of literals in the above : 515
% 0.14/0.42 # Current number of archived formulas : 0
% 0.14/0.42 # Current number of archived clauses : 21
% 0.14/0.42 # Clause-clause subsumption calls (NU) : 0
% 0.14/0.42 # Rec. Clause-clause subsumption calls : 0
% 0.14/0.42 # Non-unit clause-clause subsumptions : 0
% 0.14/0.42 # Unit Clause-clause subsumption calls : 27
% 0.14/0.42 # Rewrite failures with RHS unbound : 33
% 0.14/0.42 # BW rewrite match attempts : 190
% 0.14/0.42 # BW rewrite match successes : 90
% 0.14/0.42 # Condensation attempts : 0
% 0.14/0.42 # Condensation successes : 0
% 0.14/0.42 # Termbank termtop insertions : 10395
% 0.14/0.42
% 0.14/0.42 # -------------------------------------------------
% 0.14/0.42 # User time : 0.012 s
% 0.14/0.42 # System time : 0.001 s
% 0.14/0.42 # Total time : 0.013 s
% 0.14/0.42 # Maximum resident set size: 1428 pages
% 0.14/0.42
% 0.14/0.42 # -------------------------------------------------
% 0.14/0.42 # User time : 0.012 s
% 0.14/0.42 # System time : 0.003 s
% 0.14/0.42 # Total time : 0.015 s
% 0.14/0.42 # Maximum resident set size: 1680 pages
% 0.14/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------