TSTP Solution File: GRP193-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP193-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 07:50:11 EDT 2024
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 15 RR)
% Number of literals : 32 ( 31 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 35 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p8_9b_5,hypothesis,
greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = greatest_lower_bound(a,multiply(b,c)),
file('/export/starexec/sandbox/tmp/tmp.1MyP13uyf1/E---3.1_29906.p',p8_9b_5) ).
cnf(p8_9b_4,hypothesis,
greatest_lower_bound(a,b) = identity,
file('/export/starexec/sandbox/tmp/tmp.1MyP13uyf1/E---3.1_29906.p',p8_9b_4) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.1MyP13uyf1/E---3.1_29906.p',left_identity) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.1MyP13uyf1/E---3.1_29906.p',symmetry_of_glb) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.1MyP13uyf1/E---3.1_29906.p',lub_absorbtion) ).
cnf(associativity_of_glb,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.1MyP13uyf1/E---3.1_29906.p',associativity_of_glb) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.1MyP13uyf1/E---3.1_29906.p',symmetry_of_lub) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.1MyP13uyf1/E---3.1_29906.p',glb_absorbtion) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.1MyP13uyf1/E---3.1_29906.p',monotony_glb2) ).
cnf(p8_9b_2,hypothesis,
greatest_lower_bound(identity,b) = identity,
file('/export/starexec/sandbox/tmp/tmp.1MyP13uyf1/E---3.1_29906.p',p8_9b_2) ).
cnf(prove_p8_9b,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file('/export/starexec/sandbox/tmp/tmp.1MyP13uyf1/E---3.1_29906.p',prove_p8_9b) ).
cnf(c_0_11,hypothesis,
greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = greatest_lower_bound(a,multiply(b,c)),
p8_9b_5 ).
cnf(c_0_12,hypothesis,
greatest_lower_bound(a,b) = identity,
p8_9b_4 ).
cnf(c_0_13,hypothesis,
greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(identity,greatest_lower_bound(a,c))) = greatest_lower_bound(a,multiply(b,c)),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_15,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_16,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_17,hypothesis,
greatest_lower_bound(greatest_lower_bound(a,c),greatest_lower_bound(a,multiply(b,c))) = greatest_lower_bound(a,multiply(b,c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
associativity_of_glb ).
cnf(c_0_19,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_20,hypothesis,
greatest_lower_bound(a,greatest_lower_bound(c,greatest_lower_bound(a,multiply(b,c)))) = greatest_lower_bound(a,multiply(b,c)),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_22,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_23,hypothesis,
greatest_lower_bound(c,greatest_lower_bound(a,multiply(b,c))) = greatest_lower_bound(a,multiply(b,c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_19]) ).
cnf(c_0_24,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_25,hypothesis,
greatest_lower_bound(identity,b) = identity,
p8_9b_2 ).
cnf(c_0_26,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
inference(fof_simplification,[status(thm)],[prove_p8_9b]) ).
cnf(c_0_27,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_28,hypothesis,
least_upper_bound(c,greatest_lower_bound(a,multiply(b,c))) = c,
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_29,hypothesis,
greatest_lower_bound(X1,multiply(b,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_14]),c_0_14]) ).
cnf(c_0_30,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
c_0_26 ).
cnf(c_0_31,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18]),c_0_15]),c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP193-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 16:21:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.1MyP13uyf1/E---3.1_29906.p
% 0.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29987 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FUUPM-FFSS21-MFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with 811s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.51 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.51 # Starting G-E--_209_C18_F1_AE_CS_SP_S0Y with 136s (1) cores
% 0.21/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.51 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 29997 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FUUPM-FFSS21-MFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with 811s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.51 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 21
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 21
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 21
% 0.21/0.51 # Processed clauses : 60
% 0.21/0.51 # ...of these trivial : 3
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 56
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 5
% 0.21/0.51 # Generated clauses : 167
% 0.21/0.51 # ...of the previous two non-redundant : 115
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 167
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 172
% 0.21/0.51 # ...of those cached : 74
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 30
% 0.21/0.51 # Positive orientable unit clauses : 27
% 0.21/0.51 # Positive unorientable unit clauses: 2
% 0.21/0.51 # Negative unit clauses : 1
% 0.21/0.51 # Non-unit-clauses : 0
% 0.21/0.51 # Current number of unprocessed clauses: 97
% 0.21/0.51 # ...number of literals in the above : 97
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 26
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.51 # Non-unit clause-clause subsumptions : 0
% 0.21/0.51 # Unit Clause-clause subsumption calls : 1
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 74
% 0.21/0.51 # BW rewrite match successes : 55
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 1674
% 0.21/0.51 # Search garbage collected termcells : 2
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.007 s
% 0.21/0.51 # System time : 0.001 s
% 0.21/0.51 # Total time : 0.008 s
% 0.21/0.51 # Maximum resident set size: 1584 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.023 s
% 0.21/0.51 # System time : 0.008 s
% 0.21/0.51 # Total time : 0.032 s
% 0.21/0.51 # Maximum resident set size: 1692 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------