TSTP Solution File: GRP184-3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP184-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:57:54 EDT 2024
% Result : Unsatisfiable 0.68s 0.57s
% Output : CNFRefutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 6 RR)
% Number of literals : 39 ( 38 equ; 5 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.QRhcPb3aRe/E---3.1_1397.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/tmp/tmp.QRhcPb3aRe/E---3.1_1397.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.QRhcPb3aRe/E---3.1_1397.p',left_identity) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.QRhcPb3aRe/E---3.1_1397.p',monotony_glb2) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.QRhcPb3aRe/E---3.1_1397.p',symmetry_of_glb) ).
cnf(monotony_glb1,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.QRhcPb3aRe/E---3.1_1397.p',monotony_glb1) ).
cnf(prove_p21x,negated_conjecture,
multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) != multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)),
file('/export/starexec/sandbox2/tmp/tmp.QRhcPb3aRe/E---3.1_1397.p',prove_p21x) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.QRhcPb3aRe/E---3.1_1397.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/sandbox2/tmp/tmp.QRhcPb3aRe/E---3.1_1397.p',monotony_lub1) ).
cnf(monotony_lub2,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.QRhcPb3aRe/E---3.1_1397.p',monotony_lub2) ).
cnf(c_0_10,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_11,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_12,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_13,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_14,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_15,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_13]) ).
cnf(c_0_16,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_18,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_19,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_20,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_21,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
cnf(c_0_22,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_23,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_19,c_0_12]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) != multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)),
inference(fof_simplification,[status(thm)],[prove_p21x]) ).
cnf(c_0_25,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_21]),c_0_16]) ).
cnf(c_0_26,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_22,c_0_16]),c_0_20]) ).
cnf(c_0_27,plain,
greatest_lower_bound(identity,inverse(X1)) = multiply(greatest_lower_bound(X1,identity),inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_20]) ).
cnf(c_0_28,negated_conjecture,
multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) != multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)),
c_0_24 ).
cnf(c_0_29,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_30,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_31,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_32,plain,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
inference(spm,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_33,plain,
multiply(inverse(X1),greatest_lower_bound(X1,identity)) = multiply(greatest_lower_bound(X1,identity),inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_11]),c_0_20]),c_0_27]) ).
cnf(c_0_34,negated_conjecture,
least_upper_bound(multiply(inverse(greatest_lower_bound(identity,a)),identity),multiply(inverse(greatest_lower_bound(identity,a)),a)) != least_upper_bound(inverse(greatest_lower_bound(identity,a)),multiply(a,inverse(greatest_lower_bound(identity,a)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_20]),c_0_29]),c_0_29]),c_0_20]),c_0_30]),c_0_31]),c_0_12]) ).
cnf(c_0_35,plain,
multiply(inverse(greatest_lower_bound(X1,identity)),X1) = multiply(X1,inverse(greatest_lower_bound(X1,identity))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_32]),c_0_17]),c_0_17]) ).
cnf(c_0_36,negated_conjecture,
least_upper_bound(inverse(greatest_lower_bound(identity,a)),multiply(inverse(greatest_lower_bound(identity,a)),a)) != least_upper_bound(inverse(greatest_lower_bound(identity,a)),multiply(a,inverse(greatest_lower_bound(identity,a)))),
inference(rw,[status(thm)],[c_0_34,c_0_16]) ).
cnf(c_0_37,plain,
multiply(inverse(greatest_lower_bound(identity,X1)),X1) = multiply(X1,inverse(greatest_lower_bound(identity,X1))),
inference(spm,[status(thm)],[c_0_35,c_0_20]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP184-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 16:08:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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/tmp/tmp.QRhcPb3aRe/E---3.1_1397.p
% 0.68/0.57 # Version: 3.1.0
% 0.68/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.68/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.68/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.68/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.68/0.57 # Starting sh5l with 300s (1) cores
% 0.68/0.57 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1545 completed with status 0
% 0.68/0.57 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.68/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.68/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.68/0.57 # No SInE strategy applied
% 0.68/0.57 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.68/0.57 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.57 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.68/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.68/0.57 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.68/0.57 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.68/0.57 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.68/0.57 # U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 1554 completed with status 0
% 0.68/0.57 # Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 0.68/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.68/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.68/0.57 # No SInE strategy applied
% 0.68/0.57 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.68/0.57 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.57 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.68/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.68/0.57 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.68/0.57 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.68/0.57 # Preprocessing time : 0.001 s
% 0.68/0.57
% 0.68/0.57 # Proof found!
% 0.68/0.57 # SZS status Unsatisfiable
% 0.68/0.57 # SZS output start CNFRefutation
% See solution above
% 0.68/0.57 # Parsed axioms : 16
% 0.68/0.57 # Removed by relevancy pruning/SinE : 0
% 0.68/0.57 # Initial clauses : 16
% 0.68/0.57 # Removed in clause preprocessing : 0
% 0.68/0.57 # Initial clauses in saturation : 16
% 0.68/0.57 # Processed clauses : 495
% 0.68/0.57 # ...of these trivial : 173
% 0.68/0.57 # ...subsumed : 193
% 0.68/0.57 # ...remaining for further processing : 129
% 0.68/0.57 # Other redundant clauses eliminated : 0
% 0.68/0.57 # Clauses deleted for lack of memory : 0
% 0.68/0.57 # Backward-subsumed : 0
% 0.68/0.57 # Backward-rewritten : 14
% 0.68/0.57 # Generated clauses : 6506
% 0.68/0.57 # ...of the previous two non-redundant : 3999
% 0.68/0.57 # ...aggressively subsumed : 0
% 0.68/0.57 # Contextual simplify-reflections : 0
% 0.68/0.57 # Paramodulations : 6506
% 0.68/0.57 # Factorizations : 0
% 0.68/0.57 # NegExts : 0
% 0.68/0.57 # Equation resolutions : 0
% 0.68/0.57 # Disequality decompositions : 0
% 0.68/0.57 # Total rewrite steps : 8514
% 0.68/0.57 # ...of those cached : 6108
% 0.68/0.57 # Propositional unsat checks : 0
% 0.68/0.57 # Propositional check models : 0
% 0.68/0.57 # Propositional check unsatisfiable : 0
% 0.68/0.57 # Propositional clauses : 0
% 0.68/0.57 # Propositional clauses after purity: 0
% 0.68/0.57 # Propositional unsat core size : 0
% 0.68/0.57 # Propositional preprocessing time : 0.000
% 0.68/0.57 # Propositional encoding time : 0.000
% 0.68/0.57 # Propositional solver time : 0.000
% 0.68/0.57 # Success case prop preproc time : 0.000
% 0.68/0.57 # Success case prop encoding time : 0.000
% 0.68/0.57 # Success case prop solver time : 0.000
% 0.68/0.57 # Current number of processed clauses : 115
% 0.68/0.57 # Positive orientable unit clauses : 102
% 0.68/0.57 # Positive unorientable unit clauses: 13
% 0.68/0.57 # Negative unit clauses : 0
% 0.68/0.57 # Non-unit-clauses : 0
% 0.68/0.57 # Current number of unprocessed clauses: 3487
% 0.68/0.57 # ...number of literals in the above : 3487
% 0.68/0.57 # Current number of archived formulas : 0
% 0.68/0.57 # Current number of archived clauses : 14
% 0.68/0.57 # Clause-clause subsumption calls (NU) : 0
% 0.68/0.57 # Rec. Clause-clause subsumption calls : 0
% 0.68/0.57 # Non-unit clause-clause subsumptions : 0
% 0.68/0.57 # Unit Clause-clause subsumption calls : 37
% 0.68/0.57 # Rewrite failures with RHS unbound : 0
% 0.68/0.57 # BW rewrite match attempts : 271
% 0.68/0.57 # BW rewrite match successes : 163
% 0.68/0.57 # Condensation attempts : 0
% 0.68/0.57 # Condensation successes : 0
% 0.68/0.57 # Termbank termtop insertions : 60281
% 0.68/0.57 # Search garbage collected termcells : 2
% 0.68/0.57
% 0.68/0.57 # -------------------------------------------------
% 0.68/0.57 # User time : 0.059 s
% 0.68/0.57 # System time : 0.006 s
% 0.68/0.57 # Total time : 0.065 s
% 0.68/0.57 # Maximum resident set size: 1568 pages
% 0.68/0.57
% 0.68/0.57 # -------------------------------------------------
% 0.68/0.57 # User time : 0.282 s
% 0.68/0.57 # System time : 0.026 s
% 0.68/0.57 # Total time : 0.308 s
% 0.68/0.57 # Maximum resident set size: 1688 pages
% 0.68/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------