TSTP Solution File: SYN920+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN920+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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 : 600s
% DateTime : Thu Jul 21 06:06:12 EDT 2022
% Result : Theorem 0.24s 1.43s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 3 unt; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 94 ( 30 ~; 30 |; 20 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 22 ( 0 sgn 12 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( ( ( ! [X1] :
( ( f(X1)
& g(X1) )
=> h(X1) )
=> ? [X1] :
( f(X1)
& ~ g(X1) ) )
& ( ! [X2] :
( f(X2)
=> g(X2) )
| ! [X3] :
( f(X3)
=> h(X3) ) ) )
=> ( ! [X4] :
( ( f(X4)
& h(X4) )
=> g(X4) )
=> ? [X5] :
( f(X5)
& g(X5)
& ~ h(X5) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_this) ).
fof(c_0_1,negated_conjecture,
~ ( ( ( ! [X1] :
( ( f(X1)
& g(X1) )
=> h(X1) )
=> ? [X1] :
( f(X1)
& ~ g(X1) ) )
& ( ! [X2] :
( f(X2)
=> g(X2) )
| ! [X3] :
( f(X3)
=> h(X3) ) ) )
=> ( ! [X4] :
( ( f(X4)
& h(X4) )
=> g(X4) )
=> ? [X5] :
( f(X5)
& g(X5)
& ~ h(X5) ) ) ),
inference(assume_negation,[status(cth)],[prove_this]) ).
fof(c_0_2,negated_conjecture,
! [X8,X9,X10,X11] :
( ( f(esk2_0)
| f(esk1_0) )
& ( ~ g(esk2_0)
| f(esk1_0) )
& ( f(esk2_0)
| g(esk1_0) )
& ( ~ g(esk2_0)
| g(esk1_0) )
& ( f(esk2_0)
| ~ h(esk1_0) )
& ( ~ g(esk2_0)
| ~ h(esk1_0) )
& ( ~ f(X8)
| g(X8)
| ~ f(X9)
| h(X9) )
& ( ~ f(X10)
| ~ h(X10)
| g(X10) )
& ( ~ f(X11)
| ~ g(X11)
| h(X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])])])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( f(esk2_0)
| ~ h(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( h(X1)
| ~ g(X1)
| ~ f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( f(esk1_0)
| f(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( g(esk1_0)
| f(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( ~ h(esk1_0)
| ~ g(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( f(esk1_0)
| ~ g(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( g(esk1_0)
| ~ g(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( h(X1)
| g(X2)
| ~ f(X1)
| ~ f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
f(esk2_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]),c_0_6]) ).
cnf(c_0_12,negated_conjecture,
~ g(esk2_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_4]),c_0_8]),c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( g(X1)
| ~ h(X1)
| ~ f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( h(X1)
| ~ f(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( g(X1)
| ~ f(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_15]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN920+1 : TPTP v8.1.0. Released v3.1.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 21:35:52 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.24/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.43 # Preprocessing time : 0.014 s
% 0.24/1.43
% 0.24/1.43 # Proof found!
% 0.24/1.43 # SZS status Theorem
% 0.24/1.43 # SZS output start CNFRefutation
% See solution above
% 0.24/1.43 # Proof object total steps : 17
% 0.24/1.43 # Proof object clause steps : 14
% 0.24/1.43 # Proof object formula steps : 3
% 0.24/1.43 # Proof object conjectures : 17
% 0.24/1.43 # Proof object clause conjectures : 14
% 0.24/1.43 # Proof object formula conjectures : 3
% 0.24/1.43 # Proof object initial clauses used : 9
% 0.24/1.43 # Proof object initial formulas used : 1
% 0.24/1.43 # Proof object generating inferences : 5
% 0.24/1.43 # Proof object simplifying inferences : 7
% 0.24/1.43 # Training examples: 0 positive, 0 negative
% 0.24/1.43 # Parsed axioms : 1
% 0.24/1.43 # Removed by relevancy pruning/SinE : 0
% 0.24/1.43 # Initial clauses : 9
% 0.24/1.43 # Removed in clause preprocessing : 0
% 0.24/1.43 # Initial clauses in saturation : 9
% 0.24/1.43 # Processed clauses : 14
% 0.24/1.43 # ...of these trivial : 0
% 0.24/1.43 # ...subsumed : 1
% 0.24/1.43 # ...remaining for further processing : 13
% 0.24/1.43 # Other redundant clauses eliminated : 0
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 3
% 0.24/1.43 # Backward-rewritten : 3
% 0.24/1.43 # Generated clauses : 9
% 0.24/1.43 # ...of the previous two non-trivial : 7
% 0.24/1.43 # Contextual simplify-reflections : 5
% 0.24/1.43 # Paramodulations : 9
% 0.24/1.43 # Factorizations : 0
% 0.24/1.43 # Equation resolutions : 0
% 0.24/1.43 # Current number of processed clauses : 7
% 0.24/1.43 # Positive orientable unit clauses : 1
% 0.24/1.43 # Positive unorientable unit clauses: 0
% 0.24/1.43 # Negative unit clauses : 1
% 0.24/1.43 # Non-unit-clauses : 5
% 0.24/1.43 # Current number of unprocessed clauses: 1
% 0.24/1.43 # ...number of literals in the above : 1
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 6
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 11
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 11
% 0.24/1.43 # Non-unit clause-clause subsumptions : 8
% 0.24/1.43 # Unit Clause-clause subsumption calls : 3
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 1
% 0.24/1.43 # BW rewrite match successes : 1
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 707
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.012 s
% 0.24/1.43 # System time : 0.003 s
% 0.24/1.43 # Total time : 0.014 s
% 0.24/1.43 # Maximum resident set size: 2764 pages
%------------------------------------------------------------------------------