TSTP Solution File: GRP467-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP467-1 : TPTP v8.1.2. Released v2.6.0.
% 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:48:39 EDT 2023
% Result : Unsatisfiable 0.11s 0.42s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 6 RR)
% Number of literals : 15 ( 14 equ; 5 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(X1,X1),divide(X2,divide(divide(X3,divide(X4,X2)),inverse(X4)))) = X3,
file('/export/starexec/sandbox/tmp/tmp.wIYaZkFpCp/E---3.1_7381.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/tmp/tmp.wIYaZkFpCp/E---3.1_7381.p',prove_these_axioms_2) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox/tmp/tmp.wIYaZkFpCp/E---3.1_7381.p',multiply) ).
cnf(c_0_3,axiom,
divide(divide(X1,X1),divide(X2,divide(divide(X3,divide(X4,X2)),inverse(X4)))) = X3,
single_axiom ).
cnf(c_0_4,plain,
divide(divide(X1,X1),divide(divide(divide(X2,divide(X3,X4)),inverse(X3)),divide(X2,inverse(X4)))) = divide(X5,X5),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
prove_these_axioms_2 ).
cnf(c_0_6,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_7,plain,
divide(X1,X1) = divide(X2,X2),
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_8,negated_conjecture,
divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_9,plain,
divide(divide(X1,X1),divide(X2,divide(divide(X3,X3),inverse(X4)))) = divide(X4,X2),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
divide(divide(b2,b2),inverse(a2)) != a2,
inference(rw,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_11,plain,
divide(X1,divide(divide(X2,X2),inverse(X1))) = divide(X3,X3),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
divide(divide(X1,X1),inverse(a2)) != a2,
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_13,plain,
divide(divide(X1,X1),inverse(X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_11]),c_0_9]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : GRP467-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.08 % Command : run_E %s %d THM
% 0.07/0.27 % Computer : n018.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 2400
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Tue Oct 3 02:55:09 EDT 2023
% 0.07/0.27 % CPUTime :
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.wIYaZkFpCp/E---3.1_7381.p
% 0.11/0.42 # Version: 3.1pre001
% 0.11/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.42 # Starting sh5l with 300s (1) cores
% 0.11/0.42 # new_bool_3 with pid 7518 completed with status 0
% 0.11/0.42 # Result found by new_bool_3
% 0.11/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.42 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.11/0.42 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.42 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.11/0.42 # U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 7525 completed with status 0
% 0.11/0.42 # Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.42 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.11/0.42 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.42 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.11/0.42 # Preprocessing time : 0.001 s
% 0.11/0.42 # Presaturation interreduction done
% 0.11/0.42
% 0.11/0.42 # Proof found!
% 0.11/0.42 # SZS status Unsatisfiable
% 0.11/0.42 # SZS output start CNFRefutation
% See solution above
% 0.11/0.42 # Parsed axioms : 3
% 0.11/0.42 # Removed by relevancy pruning/SinE : 0
% 0.11/0.42 # Initial clauses : 3
% 0.11/0.42 # Removed in clause preprocessing : 0
% 0.11/0.42 # Initial clauses in saturation : 3
% 0.11/0.42 # Processed clauses : 24
% 0.11/0.42 # ...of these trivial : 0
% 0.11/0.42 # ...subsumed : 10
% 0.11/0.42 # ...remaining for further processing : 14
% 0.11/0.42 # Other redundant clauses eliminated : 0
% 0.11/0.42 # Clauses deleted for lack of memory : 0
% 0.11/0.42 # Backward-subsumed : 1
% 0.11/0.42 # Backward-rewritten : 4
% 0.11/0.42 # Generated clauses : 106
% 0.11/0.42 # ...of the previous two non-redundant : 93
% 0.11/0.42 # ...aggressively subsumed : 0
% 0.11/0.42 # Contextual simplify-reflections : 0
% 0.11/0.42 # Paramodulations : 106
% 0.11/0.42 # Factorizations : 0
% 0.11/0.42 # NegExts : 0
% 0.11/0.42 # Equation resolutions : 0
% 0.11/0.42 # Total rewrite steps : 17
% 0.11/0.42 # Propositional unsat checks : 0
% 0.11/0.42 # Propositional check models : 0
% 0.11/0.42 # Propositional check unsatisfiable : 0
% 0.11/0.42 # Propositional clauses : 0
% 0.11/0.42 # Propositional clauses after purity: 0
% 0.11/0.42 # Propositional unsat core size : 0
% 0.11/0.42 # Propositional preprocessing time : 0.000
% 0.11/0.42 # Propositional encoding time : 0.000
% 0.11/0.42 # Propositional solver time : 0.000
% 0.11/0.42 # Success case prop preproc time : 0.000
% 0.11/0.42 # Success case prop encoding time : 0.000
% 0.11/0.42 # Success case prop solver time : 0.000
% 0.11/0.42 # Current number of processed clauses : 6
% 0.11/0.42 # Positive orientable unit clauses : 4
% 0.11/0.42 # Positive unorientable unit clauses: 2
% 0.11/0.42 # Negative unit clauses : 0
% 0.11/0.42 # Non-unit-clauses : 0
% 0.11/0.42 # Current number of unprocessed clauses: 73
% 0.11/0.42 # ...number of literals in the above : 73
% 0.11/0.42 # Current number of archived formulas : 0
% 0.11/0.42 # Current number of archived clauses : 8
% 0.11/0.42 # Clause-clause subsumption calls (NU) : 0
% 0.11/0.42 # Rec. Clause-clause subsumption calls : 0
% 0.11/0.42 # Non-unit clause-clause subsumptions : 0
% 0.11/0.42 # Unit Clause-clause subsumption calls : 6
% 0.11/0.42 # Rewrite failures with RHS unbound : 0
% 0.11/0.42 # BW rewrite match attempts : 45
% 0.11/0.42 # BW rewrite match successes : 14
% 0.11/0.42 # Condensation attempts : 0
% 0.11/0.42 # Condensation successes : 0
% 0.11/0.42 # Termbank termtop insertions : 1188
% 0.11/0.42
% 0.11/0.42 # -------------------------------------------------
% 0.11/0.42 # User time : 0.003 s
% 0.11/0.42 # System time : 0.002 s
% 0.11/0.42 # Total time : 0.005 s
% 0.11/0.42 # Maximum resident set size: 1428 pages
% 0.11/0.42
% 0.11/0.42 # -------------------------------------------------
% 0.11/0.42 # User time : 0.003 s
% 0.11/0.42 # System time : 0.004 s
% 0.11/0.42 # Total time : 0.008 s
% 0.11/0.42 # Maximum resident set size: 1672 pages
% 0.11/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------