TSTP Solution File: GRP190-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP190-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:35 EDT 2023
% Result : Unsatisfiable 1.07s 0.63s
% Output : CNFRefutation 1.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of clauses : 63 ( 63 unt; 0 nHn; 5 RR)
% Number of literals : 63 ( 62 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 106 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.WoqT6QJlfS/E---3.1_27688.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/tmp/tmp.WoqT6QJlfS/E---3.1_27688.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.WoqT6QJlfS/E---3.1_27688.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/sandbox2/tmp/tmp.WoqT6QJlfS/E---3.1_27688.p',monotony_glb1) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.WoqT6QJlfS/E---3.1_27688.p',symmetry_of_glb) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.WoqT6QJlfS/E---3.1_27688.p',glb_absorbtion) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.WoqT6QJlfS/E---3.1_27688.p',symmetry_of_lub) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.WoqT6QJlfS/E---3.1_27688.p',lub_absorbtion) ).
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.WoqT6QJlfS/E---3.1_27688.p',monotony_glb2) ).
cnf(associativity_of_lub,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.WoqT6QJlfS/E---3.1_27688.p',associativity_of_lub) ).
cnf(p39a_1,hypothesis,
least_upper_bound(a,b) = a,
file('/export/starexec/sandbox2/tmp/tmp.WoqT6QJlfS/E---3.1_27688.p',p39a_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/tmp/tmp.WoqT6QJlfS/E---3.1_27688.p',monotony_lub1) ).
cnf(idempotence_of_gld,axiom,
greatest_lower_bound(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.WoqT6QJlfS/E---3.1_27688.p',idempotence_of_gld) ).
cnf(prove_p39a,negated_conjecture,
least_upper_bound(inverse(a),inverse(b)) != inverse(b),
file('/export/starexec/sandbox2/tmp/tmp.WoqT6QJlfS/E---3.1_27688.p',prove_p39a) ).
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,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
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,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_24,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_25,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_20]),c_0_23]) ).
cnf(c_0_26,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_27,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_28,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_29,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_30,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_31,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_25,c_0_15]),c_0_23]) ).
cnf(c_0_32,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_34,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_35,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_29]),c_0_20]) ).
cnf(c_0_36,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_30,c_0_16]),c_0_23]) ).
cnf(c_0_37,plain,
multiply(inverse(X1),greatest_lower_bound(identity,X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_31,c_0_23]) ).
cnf(c_0_38,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,X1)) = greatest_lower_bound(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_23]) ).
cnf(c_0_39,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
associativity_of_lub ).
cnf(c_0_40,hypothesis,
least_upper_bound(a,b) = a,
p39a_1 ).
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,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,plain,
multiply(greatest_lower_bound(X1,identity),inverse(X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_24]),c_0_23]) ).
cnf(c_0_44,plain,
greatest_lower_bound(identity,inverse(greatest_lower_bound(X1,identity))) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_15]) ).
cnf(c_0_45,plain,
least_upper_bound(X1,least_upper_bound(X2,X1)) = least_upper_bound(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_32]),c_0_27]) ).
cnf(c_0_46,hypothesis,
least_upper_bound(a,least_upper_bound(b,X1)) = least_upper_bound(a,X1),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,plain,
least_upper_bound(X1,multiply(X1,X2)) = multiply(X1,least_upper_bound(X2,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_20]),c_0_27]) ).
cnf(c_0_48,plain,
multiply(X1,inverse(greatest_lower_bound(X1,identity))) = inverse(greatest_lower_bound(identity,inverse(X1))),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,plain,
least_upper_bound(identity,inverse(greatest_lower_bound(X1,identity))) = inverse(greatest_lower_bound(X1,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_44]),c_0_27]) ).
cnf(c_0_50,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_35]),c_0_21]) ).
cnf(c_0_51,hypothesis,
least_upper_bound(b,least_upper_bound(a,X1)) = least_upper_bound(a,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_39]),c_0_45]) ).
cnf(c_0_52,plain,
multiply(inverse(X1),least_upper_bound(multiply(X1,X2),X3)) = least_upper_bound(X2,multiply(inverse(X1),X3)),
inference(spm,[status(thm)],[c_0_41,c_0_17]) ).
cnf(c_0_53,plain,
least_upper_bound(X1,inverse(greatest_lower_bound(identity,inverse(X1)))) = inverse(greatest_lower_bound(identity,inverse(X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_27]),c_0_49]),c_0_48]) ).
cnf(c_0_54,plain,
multiply(inverse(X1),inverse(X2)) = inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_17,c_0_35]) ).
cnf(c_0_55,plain,
multiply(greatest_lower_bound(X1,inverse(multiply(X2,X3))),X2) = greatest_lower_bound(multiply(X1,X2),inverse(X3)),
inference(spm,[status(thm)],[c_0_30,c_0_50]) ).
cnf(c_0_56,hypothesis,
greatest_lower_bound(b,least_upper_bound(a,X1)) = b,
inference(spm,[status(thm)],[c_0_26,c_0_51]) ).
cnf(c_0_57,plain,
least_upper_bound(X1,inverse(greatest_lower_bound(X2,inverse(X1)))) = inverse(greatest_lower_bound(X2,inverse(X1))),
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(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_55]),c_0_16]),c_0_54]),c_0_55]),c_0_16]) ).
cnf(c_0_58,hypothesis,
greatest_lower_bound(b,inverse(greatest_lower_bound(X1,inverse(a)))) = b,
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,hypothesis,
least_upper_bound(inverse(b),greatest_lower_bound(X1,inverse(a))) = inverse(b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_27]) ).
cnf(c_0_60,axiom,
greatest_lower_bound(X1,X1) = X1,
idempotence_of_gld ).
cnf(c_0_61,negated_conjecture,
least_upper_bound(inverse(a),inverse(b)) != inverse(b),
prove_p39a ).
cnf(c_0_62,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_27]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP190-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n021.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 02:24:59 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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.WoqT6QJlfS/E---3.1_27688.p
% 1.07/0.63 # Version: 3.1pre001
% 1.07/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.07/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.07/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.07/0.63 # Starting new_bool_1 with 300s (1) cores
% 1.07/0.63 # Starting sh5l with 300s (1) cores
% 1.07/0.63 # new_bool_3 with pid 27767 completed with status 0
% 1.07/0.63 # Result found by new_bool_3
% 1.07/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.07/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.07/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.07/0.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.07/0.63 # Search class: FUUPM-FFSF21-SFFFFFNN
% 1.07/0.63 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.07/0.63 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.07/0.63 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 27771 completed with status 0
% 1.07/0.63 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.07/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.07/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.07/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.07/0.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.07/0.63 # Search class: FUUPM-FFSF21-SFFFFFNN
% 1.07/0.63 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.07/0.63 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.07/0.63 # Preprocessing time : 0.001 s
% 1.07/0.63 # Presaturation interreduction done
% 1.07/0.63
% 1.07/0.63 # Proof found!
% 1.07/0.63 # SZS status Unsatisfiable
% 1.07/0.63 # SZS output start CNFRefutation
% See solution above
% 1.07/0.63 # Parsed axioms : 17
% 1.07/0.63 # Removed by relevancy pruning/SinE : 0
% 1.07/0.63 # Initial clauses : 17
% 1.07/0.63 # Removed in clause preprocessing : 0
% 1.07/0.63 # Initial clauses in saturation : 17
% 1.07/0.63 # Processed clauses : 1512
% 1.07/0.63 # ...of these trivial : 630
% 1.07/0.63 # ...subsumed : 564
% 1.07/0.63 # ...remaining for further processing : 318
% 1.07/0.63 # Other redundant clauses eliminated : 0
% 1.07/0.63 # Clauses deleted for lack of memory : 0
% 1.07/0.63 # Backward-subsumed : 0
% 1.07/0.63 # Backward-rewritten : 23
% 1.07/0.63 # Generated clauses : 20238
% 1.07/0.63 # ...of the previous two non-redundant : 12551
% 1.07/0.63 # ...aggressively subsumed : 0
% 1.07/0.63 # Contextual simplify-reflections : 0
% 1.07/0.63 # Paramodulations : 20238
% 1.07/0.63 # Factorizations : 0
% 1.07/0.63 # NegExts : 0
% 1.07/0.63 # Equation resolutions : 0
% 1.07/0.63 # Total rewrite steps : 25603
% 1.07/0.63 # Propositional unsat checks : 0
% 1.07/0.63 # Propositional check models : 0
% 1.07/0.63 # Propositional check unsatisfiable : 0
% 1.07/0.63 # Propositional clauses : 0
% 1.07/0.63 # Propositional clauses after purity: 0
% 1.07/0.63 # Propositional unsat core size : 0
% 1.07/0.63 # Propositional preprocessing time : 0.000
% 1.07/0.63 # Propositional encoding time : 0.000
% 1.07/0.63 # Propositional solver time : 0.000
% 1.07/0.63 # Success case prop preproc time : 0.000
% 1.07/0.63 # Success case prop encoding time : 0.000
% 1.07/0.63 # Success case prop solver time : 0.000
% 1.07/0.63 # Current number of processed clauses : 278
% 1.07/0.63 # Positive orientable unit clauses : 269
% 1.07/0.63 # Positive unorientable unit clauses: 8
% 1.07/0.63 # Negative unit clauses : 1
% 1.07/0.63 # Non-unit-clauses : 0
% 1.07/0.63 # Current number of unprocessed clauses: 10931
% 1.07/0.63 # ...number of literals in the above : 10931
% 1.07/0.63 # Current number of archived formulas : 0
% 1.07/0.63 # Current number of archived clauses : 40
% 1.07/0.63 # Clause-clause subsumption calls (NU) : 0
% 1.07/0.63 # Rec. Clause-clause subsumption calls : 0
% 1.07/0.63 # Non-unit clause-clause subsumptions : 0
% 1.07/0.63 # Unit Clause-clause subsumption calls : 30
% 1.07/0.63 # Rewrite failures with RHS unbound : 0
% 1.07/0.63 # BW rewrite match attempts : 565
% 1.07/0.63 # BW rewrite match successes : 306
% 1.07/0.63 # Condensation attempts : 0
% 1.07/0.63 # Condensation successes : 0
% 1.07/0.63 # Termbank termtop insertions : 215535
% 1.07/0.63
% 1.07/0.63 # -------------------------------------------------
% 1.07/0.63 # User time : 0.161 s
% 1.07/0.63 # System time : 0.013 s
% 1.07/0.63 # Total time : 0.174 s
% 1.07/0.63 # Maximum resident set size: 1616 pages
% 1.07/0.63
% 1.07/0.63 # -------------------------------------------------
% 1.07/0.63 # User time : 0.162 s
% 1.07/0.63 # System time : 0.015 s
% 1.07/0.63 # Total time : 0.177 s
% 1.07/0.63 # Maximum resident set size: 1676 pages
% 1.07/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------