TSTP Solution File: SYN920+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN920+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 20:42:32 EDT 2023
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 4 unt; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 93 ( 29 ~; 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 : 21 ( 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/tmp/tmp.eHrfV0IL9g/E---3.1_30221.p',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(fof_simplification,[status(thm)],[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(variable_rename,[status(thm)],[inference(fof_nnf,[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)
| ~ f(X1)
| ~ g(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( f(esk2_0)
| f(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( f(esk2_0)
| g(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( g(X1)
| h(X2)
| ~ f(X1)
| ~ f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,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_9,negated_conjecture,
( ~ g(esk2_0)
| ~ h(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( f(esk1_0)
| ~ g(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( g(esk1_0)
| ~ g(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( h(esk2_0)
| g(X1)
| ~ f(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
~ g(esk2_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_4]),c_0_10]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( g(X1)
| ~ f(X1)
| ~ h(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
h(esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_8]),c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_8])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN920+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 18:18:35 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.eHrfV0IL9g/E---3.1_30221.p
% 0.20/0.49 # Version: 3.1pre001
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # new_bool_3 with pid 30308 completed with status 0
% 0.20/0.49 # Result found by new_bool_3
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 30313 completed with status 0
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 1
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 9
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 9
% 0.20/0.49 # Processed clauses : 22
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 22
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 3
% 0.20/0.49 # Backward-rewritten : 4
% 0.20/0.49 # Generated clauses : 6
% 0.20/0.49 # ...of the previous two non-redundant : 4
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 4
% 0.20/0.49 # Paramodulations : 6
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Total rewrite steps : 5
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 6
% 0.20/0.49 # Positive orientable unit clauses : 2
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 3
% 0.20/0.49 # Current number of unprocessed clauses: 0
% 0.20/0.49 # ...number of literals in the above : 0
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 16
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 10
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 10
% 0.20/0.49 # Non-unit clause-clause subsumptions : 4
% 0.20/0.49 # Unit Clause-clause subsumption calls : 3
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 2
% 0.20/0.49 # BW rewrite match successes : 2
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 684
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.003 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.005 s
% 0.20/0.49 # Maximum resident set size: 1748 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1672 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------