TSTP Solution File: GRP159-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP159-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:54:32 EDT 2024
% Result : Unsatisfiable 0.11s 0.41s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 9 RR)
% Number of literals : 18 ( 17 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(prove_ax_mono2c,negated_conjecture,
least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ax_mono2c) ).
cnf(ax_mono2c_1,hypothesis,
greatest_lower_bound(a,b) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_mono2c_1) ).
cnf(monotony_lub1,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
cnf(c_0_6,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_7,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_8,negated_conjecture,
least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
inference(fof_simplification,[status(thm)],[prove_ax_mono2c]) ).
cnf(c_0_9,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,hypothesis,
greatest_lower_bound(a,b) = a,
ax_mono2c_1 ).
cnf(c_0_11,negated_conjecture,
least_upper_bound(multiply(c,a),multiply(c,b)) != multiply(c,b),
c_0_8 ).
cnf(c_0_12,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_13,hypothesis,
least_upper_bound(b,a) = b,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_15,negated_conjecture,
multiply(c,least_upper_bound(a,b)) != multiply(c,b),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
least_upper_bound(a,b) = b,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : GRP159-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.00/0.07 % Command : run_E %s %d THM
% 0.06/0.29 % Computer : n027.cluster.edu
% 0.06/0.29 % Model : x86_64 x86_64
% 0.06/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.29 % Memory : 8042.1875MB
% 0.06/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.29 % CPULimit : 300
% 0.06/0.29 % WCLimit : 300
% 0.06/0.29 % DateTime : Sun May 19 05:13:52 EDT 2024
% 0.06/0.29 % CPUTime :
% 0.11/0.39 Running first-order model finding
% 0.11/0.40 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/benchmark/theBenchmark.p
% 0.11/0.41 # Version: 3.1.0
% 0.11/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.41 # Starting sh5l with 300s (1) cores
% 0.11/0.41 # sh5l with pid 17676 completed with status 0
% 0.11/0.41 # Result found by sh5l
% 0.11/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.41 # Starting sh5l with 300s (1) cores
% 0.11/0.41 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.41 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.11/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.41 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.11/0.41 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 17682 completed with status 0
% 0.11/0.41 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.41 # Starting sh5l with 300s (1) cores
% 0.11/0.41 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.41 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.11/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.41 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.11/0.41 # Preprocessing time : 0.001 s
% 0.11/0.41 # Presaturation interreduction done
% 0.11/0.41
% 0.11/0.41 # Proof found!
% 0.11/0.41 # SZS status Unsatisfiable
% 0.11/0.41 # SZS output start CNFRefutation
% See solution above
% 0.11/0.41 # Parsed axioms : 17
% 0.11/0.41 # Removed by relevancy pruning/SinE : 0
% 0.11/0.41 # Initial clauses : 17
% 0.11/0.41 # Removed in clause preprocessing : 0
% 0.11/0.41 # Initial clauses in saturation : 17
% 0.11/0.41 # Processed clauses : 32
% 0.11/0.41 # ...of these trivial : 1
% 0.11/0.41 # ...subsumed : 0
% 0.11/0.41 # ...remaining for further processing : 31
% 0.11/0.41 # Other redundant clauses eliminated : 0
% 0.11/0.41 # Clauses deleted for lack of memory : 0
% 0.11/0.41 # Backward-subsumed : 0
% 0.11/0.41 # Backward-rewritten : 3
% 0.11/0.41 # Generated clauses : 21
% 0.11/0.41 # ...of the previous two non-redundant : 8
% 0.11/0.41 # ...aggressively subsumed : 0
% 0.11/0.41 # Contextual simplify-reflections : 0
% 0.11/0.41 # Paramodulations : 21
% 0.11/0.41 # Factorizations : 0
% 0.11/0.41 # NegExts : 0
% 0.11/0.41 # Equation resolutions : 0
% 0.11/0.41 # Disequality decompositions : 0
% 0.11/0.41 # Total rewrite steps : 18
% 0.11/0.41 # ...of those cached : 8
% 0.11/0.41 # Propositional unsat checks : 0
% 0.11/0.41 # Propositional check models : 0
% 0.11/0.41 # Propositional check unsatisfiable : 0
% 0.11/0.41 # Propositional clauses : 0
% 0.11/0.41 # Propositional clauses after purity: 0
% 0.11/0.41 # Propositional unsat core size : 0
% 0.11/0.41 # Propositional preprocessing time : 0.000
% 0.11/0.41 # Propositional encoding time : 0.000
% 0.11/0.41 # Propositional solver time : 0.000
% 0.11/0.41 # Success case prop preproc time : 0.000
% 0.11/0.41 # Success case prop encoding time : 0.000
% 0.11/0.41 # Success case prop solver time : 0.000
% 0.11/0.41 # Current number of processed clauses : 11
% 0.11/0.41 # Positive orientable unit clauses : 9
% 0.11/0.41 # Positive unorientable unit clauses: 2
% 0.11/0.41 # Negative unit clauses : 0
% 0.11/0.41 # Non-unit-clauses : 0
% 0.11/0.41 # Current number of unprocessed clauses: 10
% 0.11/0.41 # ...number of literals in the above : 10
% 0.11/0.41 # Current number of archived formulas : 0
% 0.11/0.41 # Current number of archived clauses : 20
% 0.11/0.41 # Clause-clause subsumption calls (NU) : 0
% 0.11/0.41 # Rec. Clause-clause subsumption calls : 0
% 0.11/0.41 # Non-unit clause-clause subsumptions : 0
% 0.11/0.41 # Unit Clause-clause subsumption calls : 0
% 0.11/0.41 # Rewrite failures with RHS unbound : 0
% 0.11/0.41 # BW rewrite match attempts : 43
% 0.11/0.41 # BW rewrite match successes : 38
% 0.11/0.41 # Condensation attempts : 0
% 0.11/0.41 # Condensation successes : 0
% 0.11/0.41 # Termbank termtop insertions : 338
% 0.11/0.41 # Search garbage collected termcells : 2
% 0.11/0.41
% 0.11/0.41 # -------------------------------------------------
% 0.11/0.41 # User time : 0.001 s
% 0.11/0.41 # System time : 0.003 s
% 0.11/0.41 # Total time : 0.004 s
% 0.11/0.41 # Maximum resident set size: 1616 pages
% 0.11/0.41
% 0.11/0.41 # -------------------------------------------------
% 0.11/0.41 # User time : 0.004 s
% 0.11/0.41 # System time : 0.003 s
% 0.11/0.41 # Total time : 0.007 s
% 0.11/0.41 # Maximum resident set size: 1700 pages
% 0.11/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------