TSTP Solution File: GRP192-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP192-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:39:15 EDT 2023
% Result : Unsatisfiable 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 28 unt; 0 nHn; 3 RR)
% Number of literals : 28 ( 27 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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 : 43 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.EFCPp2gKjz/E---3.1_7731.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.EFCPp2gKjz/E---3.1_7731.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.EFCPp2gKjz/E---3.1_7731.p',left_identity) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.EFCPp2gKjz/E---3.1_7731.p',glb_absorbtion) ).
cnf(p40a_1,hypothesis,
least_upper_bound(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.EFCPp2gKjz/E---3.1_7731.p',p40a_1) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.EFCPp2gKjz/E---3.1_7731.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/sandbox/tmp/tmp.EFCPp2gKjz/E---3.1_7731.p',monotony_glb1) ).
cnf(prove_p40a,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox/tmp/tmp.EFCPp2gKjz/E---3.1_7731.p',prove_p40a) ).
cnf(c_0_8,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_9,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_10,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_11,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_12,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_13,hypothesis,
least_upper_bound(identity,X1) = X1,
p40a_1 ).
cnf(c_0_14,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_15,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_16,hypothesis,
greatest_lower_bound(identity,X1) = identity,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_18,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_20,hypothesis,
greatest_lower_bound(X1,identity) = identity,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_18]),c_0_18]) ).
cnf(c_0_22,plain,
greatest_lower_bound(X1,multiply(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_20]),c_0_18]),c_0_17]) ).
cnf(c_0_23,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_24,plain,
greatest_lower_bound(X1,X2) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
multiply(a,b) != multiply(b,a),
prove_p40a ).
cnf(c_0_26,plain,
X1 = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_24]),c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP192-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 02:56:03 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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.EFCPp2gKjz/E---3.1_7731.p
% 0.19/0.49 # Version: 3.1pre001
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # sh5l with pid 7814 completed with status 0
% 0.19/0.49 # Result found by sh5l
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.49 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.49 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 7821 completed with status 0
% 0.19/0.49 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.49 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Unsatisfiable
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 17
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 17
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 17
% 0.19/0.49 # Processed clauses : 68
% 0.19/0.49 # ...of these trivial : 11
% 0.19/0.49 # ...subsumed : 2
% 0.19/0.49 # ...remaining for further processing : 55
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 37
% 0.19/0.49 # Generated clauses : 238
% 0.19/0.49 # ...of the previous two non-redundant : 124
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 238
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Total rewrite steps : 291
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 1
% 0.19/0.49 # Positive orientable unit clauses : 0
% 0.19/0.49 # Positive unorientable unit clauses: 1
% 0.19/0.49 # Negative unit clauses : 0
% 0.19/0.49 # Non-unit-clauses : 0
% 0.19/0.49 # Current number of unprocessed clauses: 79
% 0.19/0.49 # ...number of literals in the above : 79
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 54
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.49 # Non-unit clause-clause subsumptions : 0
% 0.19/0.49 # Unit Clause-clause subsumption calls : 0
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 117
% 0.19/0.49 # BW rewrite match successes : 106
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 1494
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.003 s
% 0.19/0.49 # System time : 0.004 s
% 0.19/0.49 # Total time : 0.006 s
% 0.19/0.49 # Maximum resident set size: 1600 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.004 s
% 0.19/0.49 # System time : 0.005 s
% 0.19/0.49 # Total time : 0.010 s
% 0.19/0.49 # Maximum resident set size: 1676 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------