TSTP Solution File: GRP021-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP021-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 20:51:29 EDT 2024
% Result : Unsatisfiable 272.36s 136.63s
% Output : CNFRefutation 272.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 9 unt; 0 nHn; 8 RR)
% Number of literals : 20 ( 8 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(total_function2,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',total_function2) ).
cnf(right_inverse,axiom,
product(X1,inverse(X1),identity),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',right_inverse) ).
cnf(prove_X_times_inverse_X_is_id,negated_conjecture,
multiply(a,inverse(a)) != identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_X_times_inverse_X_is_id) ).
cnf(total_function1,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',total_function1) ).
cnf(c_0_4,plain,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[total_function2]) ).
cnf(c_0_5,plain,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
c_0_4 ).
cnf(c_0_6,axiom,
product(X1,inverse(X1),identity),
right_inverse ).
cnf(c_0_7,negated_conjecture,
multiply(a,inverse(a)) != identity,
inference(fof_simplification,[status(thm)],[prove_X_times_inverse_X_is_id]) ).
cnf(c_0_8,plain,
( identity = X1
| ~ product(X2,inverse(X2),X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,axiom,
product(X1,X2,multiply(X1,X2)),
total_function1 ).
cnf(c_0_10,negated_conjecture,
multiply(a,inverse(a)) != identity,
c_0_7 ).
cnf(c_0_11,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : GRP021-1 : TPTP v8.2.0. Released v1.0.0.
% 0.15/0.16 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n003.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Sun May 19 04:40:53 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.23/0.53 Running first-order model finding
% 0.23/0.53 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 272.36/136.63 # Version: 3.1.0
% 272.36/136.63 # Preprocessing class: FSSSSMSSSSSNFFN.
% 272.36/136.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.36/136.63 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 272.36/136.63 # Starting new_bool_3 with 300s (1) cores
% 272.36/136.63 # Starting new_bool_1 with 300s (1) cores
% 272.36/136.63 # Starting sh5l with 300s (1) cores
% 272.36/136.63 # new_bool_3 with pid 14851 completed with status 0
% 272.36/136.63 # Result found by new_bool_3
% 272.36/136.63 # Preprocessing class: FSSSSMSSSSSNFFN.
% 272.36/136.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.36/136.63 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 272.36/136.63 # Starting new_bool_3 with 300s (1) cores
% 272.36/136.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 272.36/136.63 # Search class: FHUSM-FFSF21-SFFFFFNN
% 272.36/136.63 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.36/136.63 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 272.36/136.63 # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 14855 completed with status 0
% 272.36/136.63 # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 272.36/136.63 # Preprocessing class: FSSSSMSSSSSNFFN.
% 272.36/136.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.36/136.63 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 272.36/136.63 # Starting new_bool_3 with 300s (1) cores
% 272.36/136.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 272.36/136.63 # Search class: FHUSM-FFSF21-SFFFFFNN
% 272.36/136.63 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.36/136.63 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 272.36/136.63 # Preprocessing time : 0.001 s
% 272.36/136.63
% 272.36/136.63 # Proof found!
% 272.36/136.63 # SZS status Unsatisfiable
% 272.36/136.63 # SZS output start CNFRefutation
% See solution above
% 272.36/136.63 # Parsed axioms : 9
% 272.36/136.63 # Removed by relevancy pruning/SinE : 0
% 272.36/136.63 # Initial clauses : 9
% 272.36/136.63 # Removed in clause preprocessing : 0
% 272.36/136.63 # Initial clauses in saturation : 9
% 272.36/136.63 # Processed clauses : 23
% 272.36/136.63 # ...of these trivial : 1
% 272.36/136.63 # ...subsumed : 4
% 272.36/136.63 # ...remaining for further processing : 18
% 272.36/136.63 # Other redundant clauses eliminated : 0
% 272.36/136.63 # Clauses deleted for lack of memory : 0
% 272.36/136.63 # Backward-subsumed : 0
% 272.36/136.63 # Backward-rewritten : 1
% 272.36/136.63 # Generated clauses : 60
% 272.36/136.63 # ...of the previous two non-redundant : 48
% 272.36/136.63 # ...aggressively subsumed : 0
% 272.36/136.63 # Contextual simplify-reflections : 0
% 272.36/136.63 # Paramodulations : 60
% 272.36/136.63 # Factorizations : 0
% 272.36/136.63 # NegExts : 0
% 272.36/136.63 # Equation resolutions : 0
% 272.36/136.63 # Disequality decompositions : 0
% 272.36/136.63 # Total rewrite steps : 11
% 272.36/136.63 # ...of those cached : 4
% 272.36/136.63 # Propositional unsat checks : 0
% 272.36/136.63 # Propositional check models : 0
% 272.36/136.63 # Propositional check unsatisfiable : 0
% 272.36/136.63 # Propositional clauses : 0
% 272.36/136.63 # Propositional clauses after purity: 0
% 272.36/136.63 # Propositional unsat core size : 0
% 272.36/136.63 # Propositional preprocessing time : 0.000
% 272.36/136.63 # Propositional encoding time : 0.000
% 272.36/136.63 # Propositional solver time : 0.000
% 272.36/136.63 # Success case prop preproc time : 0.000
% 272.36/136.63 # Success case prop encoding time : 0.000
% 272.36/136.63 # Success case prop solver time : 0.000
% 272.36/136.63 # Current number of processed clauses : 17
% 272.36/136.63 # Positive orientable unit clauses : 10
% 272.36/136.63 # Positive unorientable unit clauses: 0
% 272.36/136.63 # Negative unit clauses : 0
% 272.36/136.63 # Non-unit-clauses : 7
% 272.36/136.63 # Current number of unprocessed clauses: 34
% 272.36/136.63 # ...number of literals in the above : 98
% 272.36/136.63 # Current number of archived formulas : 0
% 272.36/136.63 # Current number of archived clauses : 1
% 272.36/136.63 # Clause-clause subsumption calls (NU) : 19
% 272.36/136.63 # Rec. Clause-clause subsumption calls : 17
% 272.36/136.63 # Non-unit clause-clause subsumptions : 4
% 272.36/136.63 # Unit Clause-clause subsumption calls : 0
% 272.36/136.63 # Rewrite failures with RHS unbound : 0
% 272.36/136.63 # BW rewrite match attempts : 5
% 272.36/136.63 # BW rewrite match successes : 1
% 272.36/136.63 # Condensation attempts : 0
% 272.36/136.63 # Condensation successes : 0
% 272.36/136.63 # Termbank termtop insertions : 688
% 272.36/136.63 # Search garbage collected termcells : 18
% 272.36/136.63
% 272.36/136.63 # -------------------------------------------------
% 272.36/136.63 # User time : 0.002 s
% 272.36/136.63 # System time : 0.002 s
% 272.36/136.63 # Total time : 0.004 s
% 272.36/136.63 # Maximum resident set size: 1624 pages
% 272.36/136.63
% 272.36/136.63 # -------------------------------------------------
% 272.36/136.63 # User time : 0.004 s
% 272.36/136.63 # System time : 0.004 s
% 272.36/136.63 # Total time : 0.008 s
% 272.36/136.63 # Maximum resident set size: 1704 pages
% 272.36/136.63 % E---3.1 exiting
%------------------------------------------------------------------------------