TSTP Solution File: MSC004-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : MSC004-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 18:39:02 EDT 2023
% Result : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 7 unt; 4 nHn; 20 RR)
% Number of literals : 47 ( 0 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-5 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(hands_have_5_fingers,hypothesis,
( has_parts(X1,n5,fingers)
| ~ in(X1,hand) ),
file('/export/starexec/sandbox/tmp/tmp.eDtMACONpq/E---3.1_18313.p',hands_have_5_fingers) ).
cnf(not_part_inheritance,axiom,
( in(object_in(X1,X2,X3,X4,X5),X2)
| has_parts(X1,times(X4,X5),X3)
| ~ has_parts(X1,X4,X2) ),
file('/export/starexec/sandbox/tmp/tmp.eDtMACONpq/E---3.1_18313.p',not_part_inheritance) ).
cnf(part_inheritance,axiom,
( has_parts(X1,times(X2,X3),X4)
| ~ has_parts(X1,X2,X5)
| ~ has_parts(object_in(X1,X5,X4,X2,X3),X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.eDtMACONpq/E---3.1_18313.p',part_inheritance) ).
cnf(arms_have_one_hand,hypothesis,
( has_parts(X1,n1,hand)
| ~ in(X1,arm) ),
file('/export/starexec/sandbox/tmp/tmp.eDtMACONpq/E---3.1_18313.p',arms_have_one_hand) ).
cnf(humans_have_two_arms,hypothesis,
( has_parts(X1,n2,arm)
| ~ in(X1,human) ),
file('/export/starexec/sandbox/tmp/tmp.eDtMACONpq/E---3.1_18313.p',humans_have_two_arms) ).
cnf(in_boy_in_human,hypothesis,
( in(X1,human)
| ~ in(X1,boy) ),
file('/export/starexec/sandbox/tmp/tmp.eDtMACONpq/E---3.1_18313.p',in_boy_in_human) ).
cnf(prove_john_has_10_fingers,negated_conjecture,
~ has_parts(john,times(times(n2,n1),n5),fingers),
file('/export/starexec/sandbox/tmp/tmp.eDtMACONpq/E---3.1_18313.p',prove_john_has_10_fingers) ).
cnf(john_is_a_boy,hypothesis,
in(john,boy),
file('/export/starexec/sandbox/tmp/tmp.eDtMACONpq/E---3.1_18313.p',john_is_a_boy) ).
cnf(c_0_8,hypothesis,
( has_parts(X1,n5,fingers)
| ~ in(X1,hand) ),
hands_have_5_fingers ).
cnf(c_0_9,axiom,
( in(object_in(X1,X2,X3,X4,X5),X2)
| has_parts(X1,times(X4,X5),X3)
| ~ has_parts(X1,X4,X2) ),
not_part_inheritance ).
cnf(c_0_10,axiom,
( has_parts(X1,times(X2,X3),X4)
| ~ has_parts(X1,X2,X5)
| ~ has_parts(object_in(X1,X5,X4,X2,X3),X3,X4) ),
part_inheritance ).
cnf(c_0_11,hypothesis,
( has_parts(object_in(X1,hand,X2,X3,X4),n5,fingers)
| has_parts(X1,times(X3,X4),X2)
| ~ has_parts(X1,X3,hand) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,hypothesis,
( has_parts(X1,n1,hand)
| ~ in(X1,arm) ),
arms_have_one_hand ).
cnf(c_0_13,hypothesis,
( has_parts(X1,n2,arm)
| ~ in(X1,human) ),
humans_have_two_arms ).
cnf(c_0_14,hypothesis,
( in(X1,human)
| ~ in(X1,boy) ),
in_boy_in_human ).
cnf(c_0_15,negated_conjecture,
~ has_parts(john,times(times(n2,n1),n5),fingers),
prove_john_has_10_fingers ).
cnf(c_0_16,hypothesis,
( has_parts(X1,times(X2,n5),fingers)
| ~ has_parts(X1,X2,hand) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,hypothesis,
( has_parts(object_in(X1,arm,X2,X3,X4),n1,hand)
| has_parts(X1,times(X3,X4),X2)
| ~ has_parts(X1,X3,arm) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_18,hypothesis,
( has_parts(X1,n2,arm)
| ~ in(X1,boy) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,hypothesis,
in(john,boy),
john_is_a_boy ).
cnf(c_0_20,negated_conjecture,
~ has_parts(john,times(n2,n1),hand),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,hypothesis,
( has_parts(X1,times(X2,n1),hand)
| ~ has_parts(X1,X2,arm) ),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_22,hypothesis,
has_parts(john,n2,arm),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : MSC004-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n019.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 11:21:06 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.eDtMACONpq/E---3.1_18313.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_1 with pid 18425 completed with status 0
% 0.20/0.50 # Result found by new_bool_1
% 0.20/0.50 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGUNF-FFSF33-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # SAT001_MinMin_p005000_rr_RG with pid 18432 completed with status 0
% 0.20/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGUNF-FFSF33-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 8
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 8
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 8
% 0.20/0.50 # Processed clauses : 25
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 25
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 15
% 0.20/0.50 # ...of the previous two non-redundant : 12
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 15
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 1
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 17
% 0.20/0.50 # Positive orientable unit clauses : 2
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 2
% 0.20/0.50 # Non-unit-clauses : 13
% 0.20/0.50 # Current number of unprocessed clauses: 3
% 0.20/0.50 # ...number of literals in the above : 9
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 8
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 21
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 21
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 1
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 515
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.003 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.005 s
% 0.20/0.50 # Maximum resident set size: 1640 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.008 s
% 0.20/0.50 # Maximum resident set size: 1680 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------