TSTP Solution File: GRP481-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP481-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:21 EDT 2023
% Result : Unsatisfiable 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 5 RR)
% Number of literals : 17 ( 16 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox/tmp/tmp.mBvaBL67Jl/E---3.1_16746.p',identity) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox/tmp/tmp.mBvaBL67Jl/E---3.1_16746.p',inverse) ).
cnf(single_axiom,axiom,
double_divide(double_divide(double_divide(X1,double_divide(X2,identity)),double_divide(double_divide(X3,double_divide(X4,double_divide(X4,identity))),double_divide(X1,identity))),X2) = X3,
file('/export/starexec/sandbox/tmp/tmp.mBvaBL67Jl/E---3.1_16746.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != identity,
file('/export/starexec/sandbox/tmp/tmp.mBvaBL67Jl/E---3.1_16746.p',prove_these_axioms_1) ).
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox/tmp/tmp.mBvaBL67Jl/E---3.1_16746.p',multiply) ).
cnf(c_0_5,axiom,
identity = double_divide(X1,inverse(X1)),
identity ).
cnf(c_0_6,axiom,
inverse(X1) = double_divide(X1,identity),
inverse ).
cnf(c_0_7,axiom,
double_divide(double_divide(double_divide(X1,double_divide(X2,identity)),double_divide(double_divide(X3,double_divide(X4,double_divide(X4,identity))),double_divide(X1,identity))),X2) = X3,
single_axiom ).
cnf(c_0_8,plain,
identity = double_divide(X1,double_divide(X1,identity)),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
double_divide(double_divide(double_divide(X1,double_divide(X2,identity)),double_divide(double_divide(X3,identity),double_divide(X1,identity))),X2) = X3,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
multiply(inverse(a1),a1) != identity,
prove_these_axioms_1 ).
cnf(c_0_11,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_12,plain,
double_divide(double_divide(double_divide(double_divide(X1,identity),double_divide(X2,identity)),identity),X2) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
double_divide(double_divide(a1,double_divide(a1,identity)),identity) != identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_6]),c_0_11]) ).
cnf(c_0_14,plain,
double_divide(double_divide(identity,identity),double_divide(X1,identity)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_15,negated_conjecture,
double_divide(identity,identity) != identity,
inference(rw,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP481-1 : TPTP v8.1.2. Released v2.6.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 02:09:24 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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.mBvaBL67Jl/E---3.1_16746.p
% 0.19/0.48 # Version: 3.1pre001
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 16824 completed with status 0
% 0.19/0.48 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: FUUPS-FFSF22-DFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.48 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.19/0.48 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.48 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.48 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 16832 completed with status 0
% 0.19/0.48 # Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: FUUPS-FFSF22-DFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.48 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Unsatisfiable
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 5
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 5
% 0.19/0.48 # Removed in clause preprocessing : 2
% 0.19/0.48 # Initial clauses in saturation : 3
% 0.19/0.48 # Processed clauses : 9
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 0
% 0.19/0.48 # ...remaining for further processing : 9
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 1
% 0.19/0.48 # Generated clauses : 25
% 0.19/0.48 # ...of the previous two non-redundant : 21
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 25
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Total rewrite steps : 2
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 5
% 0.19/0.48 # Positive orientable unit clauses : 4
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 1
% 0.19/0.48 # Non-unit-clauses : 0
% 0.19/0.48 # Current number of unprocessed clauses: 17
% 0.19/0.48 # ...number of literals in the above : 17
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 6
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.48 # Non-unit clause-clause subsumptions : 0
% 0.19/0.48 # Unit Clause-clause subsumption calls : 0
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 1
% 0.19/0.48 # BW rewrite match successes : 1
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 450
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.002 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.004 s
% 0.19/0.48 # Maximum resident set size: 1568 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.011 s
% 0.19/0.48 # System time : 0.004 s
% 0.19/0.48 # Total time : 0.015 s
% 0.19/0.48 # Maximum resident set size: 1672 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------