TSTP Solution File: GRP460-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP460-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:41:18 EDT 2023
% Result : Unsatisfiable 0.22s 0.50s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 3 RR)
% Number of literals : 11 ( 10 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 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 : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
file('/export/starexec/sandbox/tmp/tmp.LRGynu3dVh/E---3.1_13899.p',multiply) ).
cnf(inverse,axiom,
inverse(X1) = divide(identity,X1),
file('/export/starexec/sandbox/tmp/tmp.LRGynu3dVh/E---3.1_13899.p',inverse) ).
cnf(identity,axiom,
identity = divide(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.LRGynu3dVh/E---3.1_13899.p',identity) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != identity,
file('/export/starexec/sandbox/tmp/tmp.LRGynu3dVh/E---3.1_13899.p',prove_these_axioms_1) ).
cnf(c_0_4,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
multiply ).
cnf(c_0_5,axiom,
inverse(X1) = divide(identity,X1),
inverse ).
cnf(c_0_6,axiom,
identity = divide(X1,X1),
identity ).
cnf(c_0_7,plain,
divide(X1,inverse(X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
multiply(inverse(a1),a1) != identity,
prove_these_axioms_1 ).
cnf(c_0_9,plain,
multiply(inverse(X1),X1) = identity,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP460-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 03:23:52 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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/tmp/tmp.LRGynu3dVh/E---3.1_13899.p
% 0.22/0.50 # Version: 3.1pre001
% 0.22/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50 # Starting sh5l with 300s (1) cores
% 0.22/0.50 # new_bool_3 with pid 13986 completed with status 0
% 0.22/0.50 # Result found by new_bool_3
% 0.22/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.50 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.22/0.50 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.22/0.50 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 13990 completed with status 0
% 0.22/0.50 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.22/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.50 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.22/0.50 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.22/0.50 # Preprocessing time : 0.001 s
% 0.22/0.50 # Presaturation interreduction done
% 0.22/0.50
% 0.22/0.50 # Proof found!
% 0.22/0.50 # SZS status Unsatisfiable
% 0.22/0.50 # SZS output start CNFRefutation
% See solution above
% 0.22/0.50 # Parsed axioms : 5
% 0.22/0.50 # Removed by relevancy pruning/SinE : 0
% 0.22/0.50 # Initial clauses : 5
% 0.22/0.50 # Removed in clause preprocessing : 0
% 0.22/0.50 # Initial clauses in saturation : 5
% 0.22/0.50 # Processed clauses : 11
% 0.22/0.50 # ...of these trivial : 0
% 0.22/0.50 # ...subsumed : 0
% 0.22/0.50 # ...remaining for further processing : 11
% 0.22/0.50 # Other redundant clauses eliminated : 0
% 0.22/0.50 # Clauses deleted for lack of memory : 0
% 0.22/0.50 # Backward-subsumed : 0
% 0.22/0.50 # Backward-rewritten : 1
% 0.22/0.50 # Generated clauses : 5
% 0.22/0.50 # ...of the previous two non-redundant : 4
% 0.22/0.50 # ...aggressively subsumed : 0
% 0.22/0.50 # Contextual simplify-reflections : 0
% 0.22/0.50 # Paramodulations : 5
% 0.22/0.50 # Factorizations : 0
% 0.22/0.50 # NegExts : 0
% 0.22/0.50 # Equation resolutions : 0
% 0.22/0.50 # Total rewrite steps : 5
% 0.22/0.50 # Propositional unsat checks : 0
% 0.22/0.50 # Propositional check models : 0
% 0.22/0.50 # Propositional check unsatisfiable : 0
% 0.22/0.50 # Propositional clauses : 0
% 0.22/0.50 # Propositional clauses after purity: 0
% 0.22/0.50 # Propositional unsat core size : 0
% 0.22/0.50 # Propositional preprocessing time : 0.000
% 0.22/0.50 # Propositional encoding time : 0.000
% 0.22/0.50 # Propositional solver time : 0.000
% 0.22/0.50 # Success case prop preproc time : 0.000
% 0.22/0.50 # Success case prop encoding time : 0.000
% 0.22/0.50 # Success case prop solver time : 0.000
% 0.22/0.50 # Current number of processed clauses : 5
% 0.22/0.50 # Positive orientable unit clauses : 5
% 0.22/0.50 # Positive unorientable unit clauses: 0
% 0.22/0.50 # Negative unit clauses : 0
% 0.22/0.50 # Non-unit-clauses : 0
% 0.22/0.50 # Current number of unprocessed clauses: 3
% 0.22/0.50 # ...number of literals in the above : 3
% 0.22/0.50 # Current number of archived formulas : 0
% 0.22/0.50 # Current number of archived clauses : 6
% 0.22/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.50 # Non-unit clause-clause subsumptions : 0
% 0.22/0.50 # Unit Clause-clause subsumption calls : 0
% 0.22/0.50 # Rewrite failures with RHS unbound : 0
% 0.22/0.50 # BW rewrite match attempts : 1
% 0.22/0.50 # BW rewrite match successes : 1
% 0.22/0.50 # Condensation attempts : 0
% 0.22/0.50 # Condensation successes : 0
% 0.22/0.50 # Termbank termtop insertions : 132
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.001 s
% 0.22/0.50 # System time : 0.002 s
% 0.22/0.50 # Total time : 0.003 s
% 0.22/0.50 # Maximum resident set size: 1428 pages
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.002 s
% 0.22/0.50 # System time : 0.004 s
% 0.22/0.50 # Total time : 0.006 s
% 0.22/0.50 # Maximum resident set size: 1676 pages
% 0.22/0.50 % E---3.1 exiting
% 0.22/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------