TSTP Solution File: GRP181-4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP181-4 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : Mon May 20 20:46:50 EDT 2024
% Result : Unsatisfiable 65.58s 8.82s
% Output : CNFRefutation 65.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 16 RR)
% Number of literals : 48 ( 47 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(p12x_3,hypothesis,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12x_3) ).
cnf(p12x_2,hypothesis,
inverse(inverse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12x_2) ).
cnf(monotony_glb1,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(p12x_6,hypothesis,
inverse(greatest_lower_bound(X1,X2)) = least_upper_bound(inverse(X1),inverse(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12x_6) ).
cnf(p12x_1,hypothesis,
inverse(identity) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12x_1) ).
cnf(monotony_lub1,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(p12x_4,hypothesis,
greatest_lower_bound(a,c) = greatest_lower_bound(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12x_4) ).
cnf(p12x_5,hypothesis,
least_upper_bound(a,c) = least_upper_bound(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12x_5) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
cnf(prove_p12x,negated_conjecture,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p12x) ).
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,hypothesis,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
p12x_3 ).
cnf(c_0_18,hypothesis,
inverse(inverse(X1)) = X1,
p12x_2 ).
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,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_21,hypothesis,
inverse(greatest_lower_bound(X1,X2)) = least_upper_bound(inverse(X1),inverse(X2)),
p12x_6 ).
cnf(c_0_22,hypothesis,
inverse(identity) = identity,
p12x_1 ).
cnf(c_0_23,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_24,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_25,hypothesis,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,plain,
greatest_lower_bound(identity,multiply(inverse(X1),X2)) = multiply(inverse(X1),greatest_lower_bound(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_15]),c_0_20]) ).
cnf(c_0_27,hypothesis,
inverse(greatest_lower_bound(identity,X1)) = least_upper_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,hypothesis,
multiply(inverse(X1),identity) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_22]),c_0_16]) ).
cnf(c_0_29,plain,
multiply(inverse(X1),least_upper_bound(X2,multiply(X1,X3))) = least_upper_bound(multiply(inverse(X1),X2),X3),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,hypothesis,
least_upper_bound(identity,multiply(inverse(X1),X2)) = multiply(inverse(greatest_lower_bound(X1,X2)),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_25]) ).
cnf(c_0_31,hypothesis,
multiply(X1,identity) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_32,hypothesis,
multiply(X1,multiply(inverse(greatest_lower_bound(X1,X2)),X2)) = least_upper_bound(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_18]),c_0_18]),c_0_31]) ).
cnf(c_0_33,hypothesis,
greatest_lower_bound(a,c) = greatest_lower_bound(b,c),
p12x_4 ).
cnf(c_0_34,hypothesis,
least_upper_bound(a,c) = least_upper_bound(b,c),
p12x_5 ).
cnf(c_0_35,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_36,hypothesis,
multiply(X1,multiply(inverse(greatest_lower_bound(X2,X1)),X2)) = least_upper_bound(X1,X2),
inference(spm,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_37,hypothesis,
greatest_lower_bound(c,a) = greatest_lower_bound(c,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_20]),c_0_20]) ).
cnf(c_0_38,hypothesis,
least_upper_bound(c,a) = least_upper_bound(c,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_35]) ).
cnf(c_0_39,hypothesis,
multiply(a,multiply(inverse(greatest_lower_bound(c,b)),c)) = least_upper_bound(c,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_35]),c_0_38]) ).
cnf(c_0_40,hypothesis,
multiply(inverse(greatest_lower_bound(c,b)),c) = multiply(inverse(a),least_upper_bound(c,b)),
inference(spm,[status(thm)],[c_0_24,c_0_39]) ).
cnf(c_0_41,hypothesis,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_17]),c_0_18]) ).
cnf(c_0_42,hypothesis,
multiply(b,multiply(inverse(a),least_upper_bound(c,b))) = least_upper_bound(c,b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_40]),c_0_35]) ).
cnf(c_0_43,hypothesis,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_44,negated_conjecture,
a != b,
inference(fof_simplification,[status(thm)],[prove_p12x]) ).
cnf(c_0_45,hypothesis,
inverse(a) = inverse(b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_14]),c_0_43]),c_0_31]) ).
cnf(c_0_46,negated_conjecture,
a != b,
c_0_44 ).
cnf(c_0_47,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_45]),c_0_18]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP181-4 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n019.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Sun May 19 04:21:53 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 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/benchmark/theBenchmark.p
% 65.58/8.82 # Version: 3.1.0
% 65.58/8.82 # Preprocessing class: FSMSSMSSSSSNFFN.
% 65.58/8.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 65.58/8.82 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 65.58/8.82 # Starting new_bool_3 with 300s (1) cores
% 65.58/8.82 # Starting new_bool_1 with 300s (1) cores
% 65.58/8.82 # Starting sh5l with 300s (1) cores
% 65.58/8.82 # new_bool_1 with pid 18864 completed with status 0
% 65.58/8.82 # Result found by new_bool_1
% 65.58/8.82 # Preprocessing class: FSMSSMSSSSSNFFN.
% 65.58/8.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 65.58/8.82 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 65.58/8.82 # Starting new_bool_3 with 300s (1) cores
% 65.58/8.82 # Starting new_bool_1 with 300s (1) cores
% 65.58/8.82 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 65.58/8.82 # Search class: FUUPM-FFSS21-SFFFFFNN
% 65.58/8.82 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 65.58/8.82 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 65.58/8.82 # SAT001_MinMin_p005000_rr_RG with pid 18870 completed with status 0
% 65.58/8.82 # Result found by SAT001_MinMin_p005000_rr_RG
% 65.58/8.82 # Preprocessing class: FSMSSMSSSSSNFFN.
% 65.58/8.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 65.58/8.82 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 65.58/8.82 # Starting new_bool_3 with 300s (1) cores
% 65.58/8.82 # Starting new_bool_1 with 300s (1) cores
% 65.58/8.82 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 65.58/8.82 # Search class: FUUPM-FFSS21-SFFFFFNN
% 65.58/8.82 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 65.58/8.82 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 65.58/8.82 # Preprocessing time : 0.001 s
% 65.58/8.82 # Presaturation interreduction done
% 65.58/8.82
% 65.58/8.82 # Proof found!
% 65.58/8.82 # SZS status Unsatisfiable
% 65.58/8.82 # SZS output start CNFRefutation
% See solution above
% 65.58/8.82 # Parsed axioms : 23
% 65.58/8.82 # Removed by relevancy pruning/SinE : 0
% 65.58/8.82 # Initial clauses : 23
% 65.58/8.82 # Removed in clause preprocessing : 0
% 65.58/8.82 # Initial clauses in saturation : 23
% 65.58/8.82 # Processed clauses : 23061
% 65.58/8.82 # ...of these trivial : 10152
% 65.58/8.82 # ...subsumed : 11141
% 65.58/8.82 # ...remaining for further processing : 1768
% 65.58/8.82 # Other redundant clauses eliminated : 0
% 65.58/8.82 # Clauses deleted for lack of memory : 0
% 65.58/8.82 # Backward-subsumed : 0
% 65.58/8.82 # Backward-rewritten : 161
% 65.58/8.82 # Generated clauses : 781576
% 65.58/8.82 # ...of the previous two non-redundant : 538873
% 65.58/8.82 # ...aggressively subsumed : 0
% 65.58/8.82 # Contextual simplify-reflections : 0
% 65.58/8.82 # Paramodulations : 781576
% 65.58/8.82 # Factorizations : 0
% 65.58/8.82 # NegExts : 0
% 65.58/8.82 # Equation resolutions : 0
% 65.58/8.82 # Disequality decompositions : 0
% 65.58/8.82 # Total rewrite steps : 1277138
% 65.58/8.82 # ...of those cached : 1044576
% 65.58/8.82 # Propositional unsat checks : 0
% 65.58/8.82 # Propositional check models : 0
% 65.58/8.82 # Propositional check unsatisfiable : 0
% 65.58/8.82 # Propositional clauses : 0
% 65.58/8.82 # Propositional clauses after purity: 0
% 65.58/8.82 # Propositional unsat core size : 0
% 65.58/8.82 # Propositional preprocessing time : 0.000
% 65.58/8.82 # Propositional encoding time : 0.000
% 65.58/8.82 # Propositional solver time : 0.000
% 65.58/8.82 # Success case prop preproc time : 0.000
% 65.58/8.82 # Success case prop encoding time : 0.000
% 65.58/8.82 # Success case prop solver time : 0.000
% 65.58/8.82 # Current number of processed clauses : 1584
% 65.58/8.82 # Positive orientable unit clauses : 1521
% 65.58/8.82 # Positive unorientable unit clauses: 62
% 65.58/8.82 # Negative unit clauses : 1
% 65.58/8.82 # Non-unit-clauses : 0
% 65.58/8.82 # Current number of unprocessed clauses: 515436
% 65.58/8.82 # ...number of literals in the above : 515436
% 65.58/8.82 # Current number of archived formulas : 0
% 65.58/8.82 # Current number of archived clauses : 184
% 65.58/8.82 # Clause-clause subsumption calls (NU) : 0
% 65.58/8.82 # Rec. Clause-clause subsumption calls : 0
% 65.58/8.82 # Non-unit clause-clause subsumptions : 0
% 65.58/8.82 # Unit Clause-clause subsumption calls : 718
% 65.58/8.82 # Rewrite failures with RHS unbound : 0
% 65.58/8.82 # BW rewrite match attempts : 11778
% 65.58/8.82 # BW rewrite match successes : 1147
% 65.58/8.82 # Condensation attempts : 0
% 65.58/8.82 # Condensation successes : 0
% 65.58/8.82 # Termbank termtop insertions : 12529037
% 65.58/8.82 # Search garbage collected termcells : 2
% 65.58/8.82
% 65.58/8.82 # -------------------------------------------------
% 65.58/8.82 # User time : 7.824 s
% 65.58/8.82 # System time : 0.355 s
% 65.58/8.82 # Total time : 8.179 s
% 65.58/8.82 # Maximum resident set size: 1644 pages
% 65.58/8.82
% 65.58/8.82 # -------------------------------------------------
% 65.58/8.82 # User time : 7.826 s
% 65.58/8.82 # System time : 0.358 s
% 65.58/8.82 # Total time : 8.183 s
% 65.58/8.82 # Maximum resident set size: 1704 pages
% 65.58/8.82 % E---3.1 exiting
% 65.58/8.82 % E exiting
%------------------------------------------------------------------------------