TSTP Solution File: GRP185-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP185-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:34 EDT 2023
% Result : Unsatisfiable 24.06s 3.49s
% Output : CNFRefutation 24.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 28 unt; 0 nHn; 5 RR)
% Number of literals : 28 ( 27 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 52 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.ElHYutFIEz/E---3.1_32270.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/tmp/tmp.ElHYutFIEz/E---3.1_32270.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ElHYutFIEz/E---3.1_32270.p',left_identity) ).
cnf(prove_p22b,negated_conjecture,
greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != least_upper_bound(multiply(a,b),identity),
file('/export/starexec/sandbox2/tmp/tmp.ElHYutFIEz/E---3.1_32270.p',prove_p22b) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.ElHYutFIEz/E---3.1_32270.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.ElHYutFIEz/E---3.1_32270.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.ElHYutFIEz/E---3.1_32270.p',monotony_lub2) ).
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.ElHYutFIEz/E---3.1_32270.p',associativity_of_lub) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ElHYutFIEz/E---3.1_32270.p',glb_absorbtion) ).
cnf(c_0_9,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_10,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_11,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_12,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_13,negated_conjecture,
greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != least_upper_bound(multiply(a,b),identity),
prove_p22b ).
cnf(c_0_14,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_15,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_16,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_17,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_18,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_19,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_12]) ).
cnf(c_0_20,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_21,negated_conjecture,
greatest_lower_bound(least_upper_bound(identity,multiply(a,b)),least_upper_bound(identity,least_upper_bound(multiply(a,identity),least_upper_bound(b,multiply(a,b))))) != least_upper_bound(identity,multiply(a,b)),
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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_15]),c_0_16]),c_0_11]),c_0_16]),c_0_11]),c_0_17]) ).
cnf(c_0_22,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,least_upper_bound(X2,X3))) = least_upper_bound(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_24,plain,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(X3,least_upper_bound(X1,X2)),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_25,negated_conjecture,
greatest_lower_bound(least_upper_bound(identity,multiply(a,b)),least_upper_bound(identity,least_upper_bound(a,least_upper_bound(b,multiply(a,b))))) != least_upper_bound(identity,multiply(a,b)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,least_upper_bound(X3,least_upper_bound(X4,X2)))) = least_upper_bound(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRP185-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n010.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 : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Oct 3 02:03:05 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.ElHYutFIEz/E---3.1_32270.p
% 24.06/3.49 # Version: 3.1pre001
% 24.06/3.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 24.06/3.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.06/3.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 24.06/3.49 # Starting new_bool_3 with 300s (1) cores
% 24.06/3.49 # Starting new_bool_1 with 300s (1) cores
% 24.06/3.49 # Starting sh5l with 300s (1) cores
% 24.06/3.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32347 completed with status 0
% 24.06/3.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 24.06/3.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 24.06/3.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.06/3.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 24.06/3.49 # No SInE strategy applied
% 24.06/3.49 # Search class: FUUPM-FFSF21-MFFFFFNN
% 24.06/3.49 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 24.06/3.49 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 24.06/3.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 24.06/3.49 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 24.06/3.49 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 24.06/3.49 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 24.06/3.49 # U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 32356 completed with status 0
% 24.06/3.49 # Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 24.06/3.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 24.06/3.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.06/3.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 24.06/3.49 # No SInE strategy applied
% 24.06/3.49 # Search class: FUUPM-FFSF21-MFFFFFNN
% 24.06/3.49 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 24.06/3.49 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 24.06/3.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 24.06/3.49 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 24.06/3.49 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 24.06/3.49 # Preprocessing time : 0.001 s
% 24.06/3.49
% 24.06/3.49 # Proof found!
% 24.06/3.49 # SZS status Unsatisfiable
% 24.06/3.49 # SZS output start CNFRefutation
% See solution above
% 24.06/3.49 # Parsed axioms : 16
% 24.06/3.49 # Removed by relevancy pruning/SinE : 0
% 24.06/3.49 # Initial clauses : 16
% 24.06/3.49 # Removed in clause preprocessing : 0
% 24.06/3.49 # Initial clauses in saturation : 16
% 24.06/3.49 # Processed clauses : 8073
% 24.06/3.49 # ...of these trivial : 2596
% 24.06/3.49 # ...subsumed : 4827
% 24.06/3.49 # ...remaining for further processing : 650
% 24.06/3.49 # Other redundant clauses eliminated : 0
% 24.06/3.49 # Clauses deleted for lack of memory : 0
% 24.06/3.49 # Backward-subsumed : 0
% 24.06/3.49 # Backward-rewritten : 69
% 24.06/3.49 # Generated clauses : 231049
% 24.06/3.49 # ...of the previous two non-redundant : 153592
% 24.06/3.49 # ...aggressively subsumed : 0
% 24.06/3.49 # Contextual simplify-reflections : 0
% 24.06/3.49 # Paramodulations : 231049
% 24.06/3.49 # Factorizations : 0
% 24.06/3.49 # NegExts : 0
% 24.06/3.49 # Equation resolutions : 0
% 24.06/3.49 # Total rewrite steps : 420842
% 24.06/3.49 # Propositional unsat checks : 0
% 24.06/3.49 # Propositional check models : 0
% 24.06/3.49 # Propositional check unsatisfiable : 0
% 24.06/3.49 # Propositional clauses : 0
% 24.06/3.49 # Propositional clauses after purity: 0
% 24.06/3.49 # Propositional unsat core size : 0
% 24.06/3.49 # Propositional preprocessing time : 0.000
% 24.06/3.49 # Propositional encoding time : 0.000
% 24.06/3.49 # Propositional solver time : 0.000
% 24.06/3.49 # Success case prop preproc time : 0.000
% 24.06/3.49 # Success case prop encoding time : 0.000
% 24.06/3.49 # Success case prop solver time : 0.000
% 24.06/3.49 # Current number of processed clauses : 581
% 24.06/3.49 # Positive orientable unit clauses : 517
% 24.06/3.49 # Positive unorientable unit clauses: 64
% 24.06/3.49 # Negative unit clauses : 0
% 24.06/3.49 # Non-unit-clauses : 0
% 24.06/3.49 # Current number of unprocessed clauses: 145337
% 24.06/3.49 # ...number of literals in the above : 145337
% 24.06/3.49 # Current number of archived formulas : 0
% 24.06/3.49 # Current number of archived clauses : 69
% 24.06/3.49 # Clause-clause subsumption calls (NU) : 0
% 24.06/3.49 # Rec. Clause-clause subsumption calls : 0
% 24.06/3.49 # Non-unit clause-clause subsumptions : 0
% 24.06/3.49 # Unit Clause-clause subsumption calls : 710
% 24.06/3.49 # Rewrite failures with RHS unbound : 2121
% 24.06/3.49 # BW rewrite match attempts : 4612
% 24.06/3.49 # BW rewrite match successes : 1384
% 24.06/3.49 # Condensation attempts : 0
% 24.06/3.49 # Condensation successes : 0
% 24.06/3.49 # Termbank termtop insertions : 3097622
% 24.06/3.49
% 24.06/3.49 # -------------------------------------------------
% 24.06/3.49 # User time : 2.854 s
% 24.06/3.49 # System time : 0.113 s
% 24.06/3.49 # Total time : 2.967 s
% 24.06/3.49 # Maximum resident set size: 1520 pages
% 24.06/3.49
% 24.06/3.49 # -------------------------------------------------
% 24.06/3.49 # User time : 14.304 s
% 24.06/3.49 # System time : 0.569 s
% 24.06/3.49 # Total time : 14.873 s
% 24.06/3.49 # Maximum resident set size: 1676 pages
% 24.06/3.49 % E---3.1 exiting
%------------------------------------------------------------------------------