TSTP Solution File: GRP540-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP540-1 : TPTP v8.2.0. 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 : Mon May 20 20:57:54 EDT 2024
% Result : Unsatisfiable 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 4 RR)
% Number of literals : 12 ( 11 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(X1,X2),divide(divide(X1,X3),X2)) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).
cnf(c_0_3,axiom,
divide(divide(X1,X2),divide(divide(X1,X3),X2)) = X3,
single_axiom ).
cnf(c_0_4,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
multiply ).
cnf(c_0_5,plain,
divide(multiply(X1,X2),multiply(divide(X1,X3),X2)) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_4]) ).
cnf(c_0_6,plain,
multiply(divide(X1,X2),X2) = X1,
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_7,negated_conjecture,
multiply(a,b) != multiply(b,a),
inference(fof_simplification,[status(thm)],[prove_these_axioms_4]) ).
cnf(c_0_8,plain,
divide(multiply(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
multiply(a,b) != multiply(b,a),
c_0_7 ).
cnf(c_0_10,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : GRP540-1 : TPTP v8.2.0. Bugfixed v2.7.0.
% 0.03/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Sun May 19 06:08:22 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.13/0.38 Running first-order model finding
% 0.13/0.38 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/benchmark/theBenchmark.p
% 0.13/0.39 # Version: 3.1.0
% 0.13/0.39 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.39 # Starting sh5l with 300s (1) cores
% 0.13/0.39 # new_bool_3 with pid 4091 completed with status 0
% 0.13/0.39 # Result found by new_bool_3
% 0.13/0.39 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.39 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.39 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.13/0.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.39 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 0.13/0.39 # G-E--_208_C18_F1_AE_CS_SP_S0Y with pid 4095 completed with status 0
% 0.13/0.39 # Result found by G-E--_208_C18_F1_AE_CS_SP_S0Y
% 0.13/0.39 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.39 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.39 # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.13/0.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.39 # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 181s (1) cores
% 0.13/0.39 # Preprocessing time : 0.001 s
% 0.13/0.39
% 0.13/0.39 # Proof found!
% 0.13/0.39 # SZS status Unsatisfiable
% 0.13/0.39 # SZS output start CNFRefutation
% See solution above
% 0.13/0.39 # Parsed axioms : 5
% 0.13/0.39 # Removed by relevancy pruning/SinE : 2
% 0.13/0.39 # Initial clauses : 3
% 0.13/0.39 # Removed in clause preprocessing : 0
% 0.13/0.39 # Initial clauses in saturation : 3
% 0.13/0.39 # Processed clauses : 12
% 0.13/0.39 # ...of these trivial : 0
% 0.13/0.39 # ...subsumed : 0
% 0.13/0.39 # ...remaining for further processing : 12
% 0.13/0.39 # Other redundant clauses eliminated : 0
% 0.13/0.39 # Clauses deleted for lack of memory : 0
% 0.13/0.39 # Backward-subsumed : 0
% 0.13/0.39 # Backward-rewritten : 3
% 0.13/0.39 # Generated clauses : 95
% 0.13/0.39 # ...of the previous two non-redundant : 82
% 0.13/0.39 # ...aggressively subsumed : 0
% 0.13/0.39 # Contextual simplify-reflections : 0
% 0.13/0.39 # Paramodulations : 95
% 0.13/0.39 # Factorizations : 0
% 0.13/0.39 # NegExts : 0
% 0.13/0.39 # Equation resolutions : 0
% 0.13/0.39 # Disequality decompositions : 0
% 0.13/0.39 # Total rewrite steps : 16
% 0.13/0.39 # ...of those cached : 0
% 0.13/0.39 # Propositional unsat checks : 0
% 0.13/0.39 # Propositional check models : 0
% 0.13/0.39 # Propositional check unsatisfiable : 0
% 0.13/0.39 # Propositional clauses : 0
% 0.13/0.39 # Propositional clauses after purity: 0
% 0.13/0.39 # Propositional unsat core size : 0
% 0.13/0.39 # Propositional preprocessing time : 0.000
% 0.13/0.39 # Propositional encoding time : 0.000
% 0.13/0.39 # Propositional solver time : 0.000
% 0.13/0.39 # Success case prop preproc time : 0.000
% 0.13/0.39 # Success case prop encoding time : 0.000
% 0.13/0.39 # Success case prop solver time : 0.000
% 0.13/0.39 # Current number of processed clauses : 9
% 0.13/0.39 # Positive orientable unit clauses : 8
% 0.13/0.39 # Positive unorientable unit clauses: 1
% 0.13/0.39 # Negative unit clauses : 0
% 0.13/0.39 # Non-unit-clauses : 0
% 0.13/0.39 # Current number of unprocessed clauses: 73
% 0.13/0.39 # ...number of literals in the above : 73
% 0.13/0.39 # Current number of archived formulas : 0
% 0.13/0.39 # Current number of archived clauses : 3
% 0.13/0.39 # Clause-clause subsumption calls (NU) : 0
% 0.13/0.39 # Rec. Clause-clause subsumption calls : 0
% 0.13/0.39 # Non-unit clause-clause subsumptions : 0
% 0.13/0.39 # Unit Clause-clause subsumption calls : 1
% 0.13/0.39 # Rewrite failures with RHS unbound : 0
% 0.13/0.39 # BW rewrite match attempts : 26
% 0.13/0.39 # BW rewrite match successes : 17
% 0.13/0.39 # Condensation attempts : 0
% 0.13/0.39 # Condensation successes : 0
% 0.13/0.39 # Termbank termtop insertions : 597
% 0.13/0.39 # Search garbage collected termcells : 9
% 0.13/0.39
% 0.13/0.39 # -------------------------------------------------
% 0.13/0.39 # User time : 0.004 s
% 0.13/0.39 # System time : 0.001 s
% 0.13/0.39 # Total time : 0.005 s
% 0.13/0.39 # Maximum resident set size: 1616 pages
% 0.13/0.39
% 0.13/0.39 # -------------------------------------------------
% 0.13/0.39 # User time : 0.004 s
% 0.13/0.39 # System time : 0.004 s
% 0.13/0.39 # Total time : 0.008 s
% 0.13/0.39 # Maximum resident set size: 1688 pages
% 0.13/0.39 % E---3.1 exiting
%------------------------------------------------------------------------------