TSTP Solution File: GRP174-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP174-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:29 EDT 2023
% Result : Unsatisfiable 0.18s 0.45s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 7 RR)
% Number of literals : 24 ( 23 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.eLyKxawhoZ/E---3.1_22592.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.eLyKxawhoZ/E---3.1_22592.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.eLyKxawhoZ/E---3.1_22592.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/sandbox/tmp/tmp.eLyKxawhoZ/E---3.1_22592.p',monotony_glb1) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.eLyKxawhoZ/E---3.1_22592.p',symmetry_of_glb) ).
cnf(p05b_2,hypothesis,
greatest_lower_bound(identity,inverse(a)) = inverse(a),
file('/export/starexec/sandbox/tmp/tmp.eLyKxawhoZ/E---3.1_22592.p',p05b_2) ).
cnf(p05b_1,hypothesis,
greatest_lower_bound(identity,a) = a,
file('/export/starexec/sandbox/tmp/tmp.eLyKxawhoZ/E---3.1_22592.p',p05b_1) ).
cnf(prove_p05b,negated_conjecture,
identity != a,
file('/export/starexec/sandbox/tmp/tmp.eLyKxawhoZ/E---3.1_22592.p',prove_p05b) ).
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,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_13,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_14,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_16,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_17,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_18,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_19,plain,
multiply(X1,greatest_lower_bound(X2,inverse(X1))) = greatest_lower_bound(identity,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,hypothesis,
greatest_lower_bound(identity,inverse(a)) = inverse(a),
p05b_2 ).
cnf(c_0_21,hypothesis,
greatest_lower_bound(identity,a) = a,
p05b_1 ).
cnf(c_0_22,negated_conjecture,
identity != a,
prove_p05b ).
cnf(c_0_23,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17]),c_0_14]),c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GRP174-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n018.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 03:04:24 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.18/0.43 Running first-order model finding
% 0.18/0.43 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/tmp/tmp.eLyKxawhoZ/E---3.1_22592.p
% 0.18/0.45 # Version: 3.1pre001
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.45 # Starting sh5l with 300s (1) cores
% 0.18/0.45 # new_bool_3 with pid 22670 completed with status 0
% 0.18/0.45 # Result found by new_bool_3
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.45 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.18/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.45 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.45 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 22674 completed with status 0
% 0.18/0.45 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.45 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.18/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.45 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.45 # Preprocessing time : 0.001 s
% 0.18/0.45 # Presaturation interreduction done
% 0.18/0.45
% 0.18/0.45 # Proof found!
% 0.18/0.45 # SZS status Unsatisfiable
% 0.18/0.45 # SZS output start CNFRefutation
% See solution above
% 0.18/0.45 # Parsed axioms : 18
% 0.18/0.45 # Removed by relevancy pruning/SinE : 0
% 0.18/0.45 # Initial clauses : 18
% 0.18/0.45 # Removed in clause preprocessing : 0
% 0.18/0.45 # Initial clauses in saturation : 18
% 0.18/0.45 # Processed clauses : 116
% 0.18/0.45 # ...of these trivial : 42
% 0.18/0.45 # ...subsumed : 2
% 0.18/0.45 # ...remaining for further processing : 72
% 0.18/0.45 # Other redundant clauses eliminated : 0
% 0.18/0.45 # Clauses deleted for lack of memory : 0
% 0.18/0.45 # Backward-subsumed : 0
% 0.18/0.45 # Backward-rewritten : 3
% 0.18/0.45 # Generated clauses : 633
% 0.18/0.45 # ...of the previous two non-redundant : 260
% 0.18/0.45 # ...aggressively subsumed : 0
% 0.18/0.45 # Contextual simplify-reflections : 0
% 0.18/0.45 # Paramodulations : 633
% 0.18/0.45 # Factorizations : 0
% 0.18/0.45 # NegExts : 0
% 0.18/0.45 # Equation resolutions : 0
% 0.18/0.45 # Total rewrite steps : 710
% 0.18/0.45 # Propositional unsat checks : 0
% 0.18/0.45 # Propositional check models : 0
% 0.18/0.45 # Propositional check unsatisfiable : 0
% 0.18/0.45 # Propositional clauses : 0
% 0.18/0.45 # Propositional clauses after purity: 0
% 0.18/0.45 # Propositional unsat core size : 0
% 0.18/0.45 # Propositional preprocessing time : 0.000
% 0.18/0.45 # Propositional encoding time : 0.000
% 0.18/0.45 # Propositional solver time : 0.000
% 0.18/0.45 # Success case prop preproc time : 0.000
% 0.18/0.45 # Success case prop encoding time : 0.000
% 0.18/0.45 # Success case prop solver time : 0.000
% 0.18/0.45 # Current number of processed clauses : 51
% 0.18/0.45 # Positive orientable unit clauses : 48
% 0.18/0.45 # Positive unorientable unit clauses: 2
% 0.18/0.45 # Negative unit clauses : 1
% 0.18/0.45 # Non-unit-clauses : 0
% 0.18/0.45 # Current number of unprocessed clauses: 164
% 0.18/0.45 # ...number of literals in the above : 164
% 0.18/0.45 # Current number of archived formulas : 0
% 0.18/0.45 # Current number of archived clauses : 21
% 0.18/0.45 # Clause-clause subsumption calls (NU) : 0
% 0.18/0.45 # Rec. Clause-clause subsumption calls : 0
% 0.18/0.45 # Non-unit clause-clause subsumptions : 0
% 0.18/0.45 # Unit Clause-clause subsumption calls : 0
% 0.18/0.45 # Rewrite failures with RHS unbound : 0
% 0.18/0.45 # BW rewrite match attempts : 53
% 0.18/0.45 # BW rewrite match successes : 39
% 0.18/0.45 # Condensation attempts : 0
% 0.18/0.45 # Condensation successes : 0
% 0.18/0.45 # Termbank termtop insertions : 4320
% 0.18/0.45
% 0.18/0.45 # -------------------------------------------------
% 0.18/0.45 # User time : 0.006 s
% 0.18/0.45 # System time : 0.001 s
% 0.18/0.45 # Total time : 0.008 s
% 0.18/0.45 # Maximum resident set size: 1616 pages
% 0.18/0.45
% 0.18/0.45 # -------------------------------------------------
% 0.18/0.45 # User time : 0.009 s
% 0.18/0.45 # System time : 0.002 s
% 0.18/0.45 # Total time : 0.011 s
% 0.18/0.45 # Maximum resident set size: 1672 pages
% 0.18/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------