TSTP Solution File: GRP168-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP168-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:05 EDT 2023
% Result : Unsatisfiable 0.36s 0.55s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 5 RR)
% Number of literals : 9 ( 8 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_p01b,negated_conjecture,
greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) != multiply(inverse(c),multiply(a,c)),
file('/export/starexec/sandbox2/tmp/tmp.799AOpxvG4/E---3.1_957.p',prove_p01b) ).
cnf(monotony_glb1,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.799AOpxvG4/E---3.1_957.p',monotony_glb1) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.799AOpxvG4/E---3.1_957.p',monotony_glb2) ).
cnf(p01b_1,hypothesis,
greatest_lower_bound(a,b) = a,
file('/export/starexec/sandbox2/tmp/tmp.799AOpxvG4/E---3.1_957.p',p01b_1) ).
cnf(c_0_4,negated_conjecture,
greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) != multiply(inverse(c),multiply(a,c)),
prove_p01b ).
cnf(c_0_5,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_6,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_7,hypothesis,
greatest_lower_bound(a,b) = a,
p01b_1 ).
cnf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.16 % Problem : GRP168-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.13/0.17 % Command : run_E %s %d THM
% 0.15/0.39 % Computer : n021.cluster.edu
% 0.15/0.39 % Model : x86_64 x86_64
% 0.15/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39 % Memory : 8042.1875MB
% 0.15/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.39 % CPULimit : 2400
% 0.15/0.39 % WCLimit : 300
% 0.15/0.39 % DateTime : Tue Oct 3 02:34:59 EDT 2023
% 0.15/0.39 % CPUTime :
% 0.22/0.54 Running first-order theorem proving
% 0.22/0.54 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.799AOpxvG4/E---3.1_957.p
% 0.36/0.55 # Version: 3.1pre001
% 0.36/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.55 # Starting sh5l with 300s (1) cores
% 0.36/0.55 # new_bool_3 with pid 1062 completed with status 0
% 0.36/0.55 # Result found by new_bool_3
% 0.36/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/0.55 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.36/0.55 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.55 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.36/0.55 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 1067 completed with status 0
% 0.36/0.55 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.36/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/0.55 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.36/0.55 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.55 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.36/0.55 # Preprocessing time : 0.001 s
% 0.36/0.55 # Presaturation interreduction done
% 0.36/0.55
% 0.36/0.55 # Proof found!
% 0.36/0.55 # SZS status Unsatisfiable
% 0.36/0.55 # SZS output start CNFRefutation
% See solution above
% 0.36/0.55 # Parsed axioms : 17
% 0.36/0.55 # Removed by relevancy pruning/SinE : 0
% 0.36/0.55 # Initial clauses : 17
% 0.36/0.55 # Removed in clause preprocessing : 0
% 0.36/0.55 # Initial clauses in saturation : 17
% 0.36/0.55 # Processed clauses : 18
% 0.36/0.55 # ...of these trivial : 0
% 0.36/0.55 # ...subsumed : 0
% 0.36/0.55 # ...remaining for further processing : 17
% 0.36/0.55 # Other redundant clauses eliminated : 0
% 0.36/0.55 # Clauses deleted for lack of memory : 0
% 0.36/0.55 # Backward-subsumed : 0
% 0.36/0.55 # Backward-rewritten : 1
% 0.36/0.55 # Generated clauses : 0
% 0.36/0.55 # ...of the previous two non-redundant : 1
% 0.36/0.55 # ...aggressively subsumed : 0
% 0.36/0.55 # Contextual simplify-reflections : 0
% 0.36/0.55 # Paramodulations : 0
% 0.36/0.55 # Factorizations : 0
% 0.36/0.55 # NegExts : 0
% 0.36/0.55 # Equation resolutions : 0
% 0.36/0.55 # Total rewrite steps : 3
% 0.36/0.55 # Propositional unsat checks : 0
% 0.36/0.55 # Propositional check models : 0
% 0.36/0.55 # Propositional check unsatisfiable : 0
% 0.36/0.55 # Propositional clauses : 0
% 0.36/0.55 # Propositional clauses after purity: 0
% 0.36/0.55 # Propositional unsat core size : 0
% 0.36/0.55 # Propositional preprocessing time : 0.000
% 0.36/0.55 # Propositional encoding time : 0.000
% 0.36/0.55 # Propositional solver time : 0.000
% 0.36/0.55 # Success case prop preproc time : 0.000
% 0.36/0.55 # Success case prop encoding time : 0.000
% 0.36/0.55 # Success case prop solver time : 0.000
% 0.36/0.55 # Current number of processed clauses : 16
% 0.36/0.55 # Positive orientable unit clauses : 14
% 0.36/0.55 # Positive unorientable unit clauses: 2
% 0.36/0.55 # Negative unit clauses : 0
% 0.36/0.55 # Non-unit-clauses : 0
% 0.36/0.55 # Current number of unprocessed clauses: 0
% 0.36/0.55 # ...number of literals in the above : 0
% 0.36/0.55 # Current number of archived formulas : 0
% 0.36/0.55 # Current number of archived clauses : 1
% 0.36/0.55 # Clause-clause subsumption calls (NU) : 0
% 0.36/0.55 # Rec. Clause-clause subsumption calls : 0
% 0.36/0.55 # Non-unit clause-clause subsumptions : 0
% 0.36/0.55 # Unit Clause-clause subsumption calls : 0
% 0.36/0.55 # Rewrite failures with RHS unbound : 0
% 0.36/0.55 # BW rewrite match attempts : 23
% 0.36/0.55 # BW rewrite match successes : 17
% 0.36/0.55 # Condensation attempts : 0
% 0.36/0.55 # Condensation successes : 0
% 0.36/0.55 # Termbank termtop insertions : 257
% 0.36/0.55
% 0.36/0.55 # -------------------------------------------------
% 0.36/0.55 # User time : 0.000 s
% 0.36/0.55 # System time : 0.003 s
% 0.36/0.55 # Total time : 0.003 s
% 0.36/0.55 # Maximum resident set size: 1616 pages
% 0.36/0.55
% 0.36/0.55 # -------------------------------------------------
% 0.36/0.55 # User time : 0.002 s
% 0.36/0.55 # System time : 0.004 s
% 0.36/0.55 # Total time : 0.006 s
% 0.36/0.55 # Maximum resident set size: 1676 pages
% 0.36/0.55 % E---3.1 exiting
% 0.36/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------