TSTP Solution File: GRP170-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP170-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:46:27 EDT 2023
% Result : Unsatisfiable 0.16s 0.53s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of clauses : 52 ( 52 unt; 0 nHn; 10 RR)
% Number of literals : 52 ( 51 equ; 2 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 : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 82 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.SnN463rr0i/E---3.1_3519.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.SnN463rr0i/E---3.1_3519.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.SnN463rr0i/E---3.1_3519.p',left_identity) ).
cnf(monotony_glb1,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.SnN463rr0i/E---3.1_3519.p',monotony_glb1) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.SnN463rr0i/E---3.1_3519.p',symmetry_of_glb) ).
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.SnN463rr0i/E---3.1_3519.p',monotony_glb2) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.SnN463rr0i/E---3.1_3519.p',lub_absorbtion) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.SnN463rr0i/E---3.1_3519.p',glb_absorbtion) ).
cnf(p03c_2,hypothesis,
least_upper_bound(c,d) = d,
file('/export/starexec/sandbox/tmp/tmp.SnN463rr0i/E---3.1_3519.p',p03c_2) ).
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.SnN463rr0i/E---3.1_3519.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.SnN463rr0i/E---3.1_3519.p',symmetry_of_lub) ).
cnf(monotony_lub1,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.SnN463rr0i/E---3.1_3519.p',monotony_lub1) ).
cnf(p03c_1,hypothesis,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox/tmp/tmp.SnN463rr0i/E---3.1_3519.p',p03c_1) ).
cnf(prove_p03c,negated_conjecture,
greatest_lower_bound(multiply(a,c),multiply(b,d)) != multiply(a,c),
file('/export/starexec/sandbox/tmp/tmp.SnN463rr0i/E---3.1_3519.p',prove_p03c) ).
cnf(c_0_14,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_15,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_16,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_17,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_19,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_20,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_21,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_23,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_24,plain,
greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(X2,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_26,plain,
greatest_lower_bound(X1,multiply(X2,X1)) = multiply(greatest_lower_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_16]),c_0_22]) ).
cnf(c_0_27,plain,
multiply(inverse(X1),greatest_lower_bound(X1,identity)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_15]),c_0_22]) ).
cnf(c_0_28,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_29,hypothesis,
least_upper_bound(c,d) = d,
p03c_2 ).
cnf(c_0_30,plain,
least_upper_bound(X1,multiply(greatest_lower_bound(X2,identity),X1)) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
multiply(inverse(X1),greatest_lower_bound(identity,X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
cnf(c_0_32,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_33,hypothesis,
greatest_lower_bound(c,d) = c,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
least_upper_bound(X1,multiply(greatest_lower_bound(identity,X2),X1)) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_35,plain,
greatest_lower_bound(identity,inverse(least_upper_bound(identity,X1))) = inverse(least_upper_bound(identity,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_21]) ).
cnf(c_0_36,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_21]),c_0_21]) ).
cnf(c_0_37,hypothesis,
greatest_lower_bound(c,greatest_lower_bound(d,X1)) = greatest_lower_bound(c,X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
least_upper_bound(X1,multiply(inverse(least_upper_bound(identity,X2)),X1)) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_36]) ).
cnf(c_0_40,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_41,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_42,hypothesis,
greatest_lower_bound(c,least_upper_bound(d,X1)) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_28]),c_0_33]) ).
cnf(c_0_43,plain,
least_upper_bound(X1,multiply(least_upper_bound(identity,X2),X1)) = multiply(least_upper_bound(identity,X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_36]),c_0_36]),c_0_40]) ).
cnf(c_0_44,plain,
multiply(inverse(X1),least_upper_bound(X1,X2)) = least_upper_bound(identity,multiply(inverse(X1),X2)),
inference(spm,[status(thm)],[c_0_41,c_0_15]) ).
cnf(c_0_45,hypothesis,
least_upper_bound(a,b) = b,
p03c_1 ).
cnf(c_0_46,hypothesis,
greatest_lower_bound(c,multiply(least_upper_bound(identity,X1),d)) = c,
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,hypothesis,
least_upper_bound(identity,multiply(inverse(a),b)) = multiply(inverse(a),b),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
multiply(inverse(X1),greatest_lower_bound(X2,multiply(X1,X3))) = greatest_lower_bound(multiply(inverse(X1),X2),X3),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_49,hypothesis,
greatest_lower_bound(c,multiply(inverse(a),multiply(b,d))) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_14]) ).
cnf(c_0_50,negated_conjecture,
greatest_lower_bound(multiply(a,c),multiply(b,d)) != multiply(a,c),
prove_p03c ).
cnf(c_0_51,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_36]),c_0_36]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP170-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n029.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Oct 3 02:36:52 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 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.SnN463rr0i/E---3.1_3519.p
% 0.16/0.53 # Version: 3.1pre001
% 0.16/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.53 # Starting sh5l with 300s (1) cores
% 0.16/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3596 completed with status 0
% 0.16/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.53 # No SInE strategy applied
% 0.16/0.53 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.16/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.53 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.16/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.53 # Starting sh5l with 136s (1) cores
% 0.16/0.53 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 3600 completed with status 0
% 0.16/0.53 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.53 # No SInE strategy applied
% 0.16/0.53 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.16/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.53 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.16/0.53 # Preprocessing time : 0.001 s
% 0.16/0.53 # Presaturation interreduction done
% 0.16/0.53
% 0.16/0.53 # Proof found!
% 0.16/0.53 # SZS status Unsatisfiable
% 0.16/0.53 # SZS output start CNFRefutation
% See solution above
% 0.16/0.53 # Parsed axioms : 18
% 0.16/0.53 # Removed by relevancy pruning/SinE : 0
% 0.16/0.53 # Initial clauses : 18
% 0.16/0.53 # Removed in clause preprocessing : 0
% 0.16/0.53 # Initial clauses in saturation : 18
% 0.16/0.53 # Processed clauses : 955
% 0.16/0.53 # ...of these trivial : 367
% 0.16/0.53 # ...subsumed : 314
% 0.16/0.53 # ...remaining for further processing : 274
% 0.16/0.53 # Other redundant clauses eliminated : 0
% 0.16/0.53 # Clauses deleted for lack of memory : 0
% 0.16/0.53 # Backward-subsumed : 0
% 0.16/0.53 # Backward-rewritten : 17
% 0.16/0.53 # Generated clauses : 12389
% 0.16/0.53 # ...of the previous two non-redundant : 6555
% 0.16/0.53 # ...aggressively subsumed : 0
% 0.16/0.53 # Contextual simplify-reflections : 0
% 0.16/0.53 # Paramodulations : 12389
% 0.16/0.53 # Factorizations : 0
% 0.16/0.53 # NegExts : 0
% 0.16/0.53 # Equation resolutions : 0
% 0.16/0.53 # Total rewrite steps : 14485
% 0.16/0.53 # Propositional unsat checks : 0
% 0.16/0.53 # Propositional check models : 0
% 0.16/0.53 # Propositional check unsatisfiable : 0
% 0.16/0.53 # Propositional clauses : 0
% 0.16/0.53 # Propositional clauses after purity: 0
% 0.16/0.53 # Propositional unsat core size : 0
% 0.16/0.53 # Propositional preprocessing time : 0.000
% 0.16/0.53 # Propositional encoding time : 0.000
% 0.16/0.53 # Propositional solver time : 0.000
% 0.16/0.53 # Success case prop preproc time : 0.000
% 0.16/0.53 # Success case prop encoding time : 0.000
% 0.16/0.53 # Success case prop solver time : 0.000
% 0.16/0.53 # Current number of processed clauses : 239
% 0.16/0.53 # Positive orientable unit clauses : 230
% 0.16/0.53 # Positive unorientable unit clauses: 8
% 0.16/0.53 # Negative unit clauses : 1
% 0.16/0.53 # Non-unit-clauses : 0
% 0.16/0.53 # Current number of unprocessed clauses: 5536
% 0.16/0.53 # ...number of literals in the above : 5536
% 0.16/0.53 # Current number of archived formulas : 0
% 0.16/0.53 # Current number of archived clauses : 35
% 0.16/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.53 # Non-unit clause-clause subsumptions : 0
% 0.16/0.53 # Unit Clause-clause subsumption calls : 26
% 0.16/0.53 # Rewrite failures with RHS unbound : 0
% 0.16/0.53 # BW rewrite match attempts : 573
% 0.16/0.53 # BW rewrite match successes : 347
% 0.16/0.53 # Condensation attempts : 0
% 0.16/0.53 # Condensation successes : 0
% 0.16/0.53 # Termbank termtop insertions : 112019
% 0.16/0.53
% 0.16/0.53 # -------------------------------------------------
% 0.16/0.53 # User time : 0.078 s
% 0.16/0.53 # System time : 0.011 s
% 0.16/0.53 # Total time : 0.089 s
% 0.16/0.53 # Maximum resident set size: 1528 pages
% 0.16/0.53
% 0.16/0.53 # -------------------------------------------------
% 0.16/0.53 # User time : 0.426 s
% 0.16/0.53 # System time : 0.016 s
% 0.16/0.53 # Total time : 0.442 s
% 0.16/0.53 # Maximum resident set size: 1676 pages
% 0.16/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------