TSTP Solution File: GRP172-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP172-2 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:54:38 EDT 2024
% Result : Unsatisfiable 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 12 RR)
% Number of literals : 48 ( 47 equ; 3 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 : 67 ( 11 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(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(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(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
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(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(p04d_1,hypothesis,
greatest_lower_bound(identity,a) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p04d_1) ).
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/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
cnf(p04d_2,hypothesis,
greatest_lower_bound(identity,b) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p04d_2) ).
cnf(prove_p04d,negated_conjecture,
least_upper_bound(identity,multiply(a,b)) != multiply(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p04d) ).
cnf(c_0_12,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_13,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_14,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_15,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_17,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_18,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_19,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_21,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_22,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_23,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_24,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_18,c_0_19]),c_0_20]) ).
cnf(c_0_25,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,hypothesis,
greatest_lower_bound(identity,a) = identity,
p04d_1 ).
cnf(c_0_27,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_28,hypothesis,
greatest_lower_bound(identity,b) = identity,
p04d_2 ).
cnf(c_0_29,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_30,plain,
greatest_lower_bound(X1,multiply(X1,least_upper_bound(X2,identity))) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,hypothesis,
least_upper_bound(a,identity) = a,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,hypothesis,
greatest_lower_bound(identity,greatest_lower_bound(b,X1)) = greatest_lower_bound(identity,X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,X1)) = greatest_lower_bound(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_21]),c_0_27]) ).
cnf(c_0_34,plain,
greatest_lower_bound(X1,multiply(X1,least_upper_bound(identity,X2))) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_35,hypothesis,
least_upper_bound(identity,a) = a,
inference(rw,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_36,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_19]),c_0_19]) ).
cnf(c_0_37,plain,
least_upper_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_38,hypothesis,
greatest_lower_bound(identity,greatest_lower_bound(X1,b)) = greatest_lower_bound(identity,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_32]) ).
cnf(c_0_39,hypothesis,
greatest_lower_bound(X1,multiply(X1,a)) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_13,c_0_36]) ).
cnf(c_0_41,hypothesis,
least_upper_bound(b,greatest_lower_bound(identity,X1)) = b,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,hypothesis,
greatest_lower_bound(identity,inverse(a)) = inverse(a),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_13]),c_0_22]) ).
cnf(c_0_43,negated_conjecture,
least_upper_bound(identity,multiply(a,b)) != multiply(a,b),
inference(fof_simplification,[status(thm)],[prove_p04d]) ).
cnf(c_0_44,plain,
multiply(X1,least_upper_bound(X2,inverse(X1))) = least_upper_bound(identity,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_40]),c_0_20]) ).
cnf(c_0_45,hypothesis,
least_upper_bound(b,inverse(a)) = b,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
least_upper_bound(identity,multiply(a,b)) != multiply(a,b),
c_0_43 ).
cnf(c_0_47,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : GRP172-2 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n032.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun May 19 05:02:22 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.14/0.38 Running first-order model finding
% 0.14/0.38 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/benchmark/theBenchmark.p
% 0.14/0.40 # Version: 3.1.0
% 0.14/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.40 # Starting sh5l with 300s (1) cores
% 0.14/0.40 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6883 completed with status 0
% 0.14/0.40 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.40 # No SInE strategy applied
% 0.14/0.40 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.14/0.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.40 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.14/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.40 # Starting new_bool_3 with 136s (1) cores
% 0.14/0.40 # Starting new_bool_1 with 136s (1) cores
% 0.14/0.40 # Starting sh5l with 136s (1) cores
% 0.14/0.40 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 6887 completed with status 0
% 0.14/0.40 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.40 # No SInE strategy applied
% 0.14/0.40 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.14/0.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.40 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.14/0.40 # Preprocessing time : 0.001 s
% 0.14/0.40 # Presaturation interreduction done
% 0.14/0.40
% 0.14/0.40 # Proof found!
% 0.14/0.40 # SZS status Unsatisfiable
% 0.14/0.40 # SZS output start CNFRefutation
% See solution above
% 0.14/0.40 # Parsed axioms : 18
% 0.14/0.40 # Removed by relevancy pruning/SinE : 0
% 0.14/0.40 # Initial clauses : 18
% 0.14/0.40 # Removed in clause preprocessing : 0
% 0.14/0.40 # Initial clauses in saturation : 18
% 0.14/0.40 # Processed clauses : 215
% 0.14/0.40 # ...of these trivial : 58
% 0.14/0.40 # ...subsumed : 38
% 0.14/0.40 # ...remaining for further processing : 119
% 0.14/0.40 # Other redundant clauses eliminated : 0
% 0.14/0.40 # Clauses deleted for lack of memory : 0
% 0.14/0.40 # Backward-subsumed : 0
% 0.14/0.40 # Backward-rewritten : 6
% 0.14/0.40 # Generated clauses : 1837
% 0.14/0.40 # ...of the previous two non-redundant : 795
% 0.14/0.40 # ...aggressively subsumed : 0
% 0.14/0.40 # Contextual simplify-reflections : 0
% 0.14/0.40 # Paramodulations : 1837
% 0.14/0.40 # Factorizations : 0
% 0.14/0.40 # NegExts : 0
% 0.14/0.40 # Equation resolutions : 0
% 0.14/0.40 # Disequality decompositions : 0
% 0.14/0.40 # Total rewrite steps : 2111
% 0.14/0.40 # ...of those cached : 1453
% 0.14/0.40 # Propositional unsat checks : 0
% 0.14/0.40 # Propositional check models : 0
% 0.14/0.40 # Propositional check unsatisfiable : 0
% 0.14/0.40 # Propositional clauses : 0
% 0.14/0.40 # Propositional clauses after purity: 0
% 0.14/0.40 # Propositional unsat core size : 0
% 0.14/0.40 # Propositional preprocessing time : 0.000
% 0.14/0.40 # Propositional encoding time : 0.000
% 0.14/0.40 # Propositional solver time : 0.000
% 0.14/0.40 # Success case prop preproc time : 0.000
% 0.14/0.40 # Success case prop encoding time : 0.000
% 0.14/0.40 # Success case prop solver time : 0.000
% 0.14/0.40 # Current number of processed clauses : 95
% 0.14/0.40 # Positive orientable unit clauses : 92
% 0.14/0.40 # Positive unorientable unit clauses: 2
% 0.14/0.40 # Negative unit clauses : 1
% 0.14/0.40 # Non-unit-clauses : 0
% 0.14/0.40 # Current number of unprocessed clauses: 605
% 0.14/0.40 # ...number of literals in the above : 605
% 0.14/0.40 # Current number of archived formulas : 0
% 0.14/0.40 # Current number of archived clauses : 24
% 0.14/0.40 # Clause-clause subsumption calls (NU) : 0
% 0.14/0.40 # Rec. Clause-clause subsumption calls : 0
% 0.14/0.40 # Non-unit clause-clause subsumptions : 0
% 0.14/0.40 # Unit Clause-clause subsumption calls : 0
% 0.14/0.40 # Rewrite failures with RHS unbound : 0
% 0.14/0.40 # BW rewrite match attempts : 78
% 0.14/0.40 # BW rewrite match successes : 46
% 0.14/0.40 # Condensation attempts : 0
% 0.14/0.40 # Condensation successes : 0
% 0.14/0.40 # Termbank termtop insertions : 13747
% 0.14/0.40 # Search garbage collected termcells : 2
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.010 s
% 0.14/0.40 # System time : 0.001 s
% 0.14/0.40 # Total time : 0.012 s
% 0.14/0.40 # Maximum resident set size: 1568 pages
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.050 s
% 0.14/0.40 # System time : 0.006 s
% 0.14/0.40 # Total time : 0.056 s
% 0.14/0.40 # Maximum resident set size: 1696 pages
% 0.14/0.40 % E---3.1 exiting
%------------------------------------------------------------------------------