TSTP Solution File: PUZ003-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : PUZ003-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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:11:32 EDT 2024
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 15 unt; 0 nHn; 24 RR)
% Number of literals : 43 ( 0 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(one_shaved_then_all_shaved,axiom,
( shaved(members,X1)
| ~ member(X1)
| ~ member(X2)
| ~ shaved(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.cLpjDVRjYo/E---3.1_25228.p',one_shaved_then_all_shaved) ).
cnf(all_shaved_then_one_shaved,axiom,
( shaved(X2,X1)
| ~ shaved(members,X1)
| ~ member(X2) ),
file('/export/starexec/sandbox/tmp/tmp.cLpjDVRjYo/E---3.1_25228.p',all_shaved_then_one_shaved) ).
cnf(guido_has_shaved_cesare,hypothesis,
shaved(guido,cesare),
file('/export/starexec/sandbox/tmp/tmp.cLpjDVRjYo/E---3.1_25228.p',guido_has_shaved_cesare) ).
cnf(cesare,hypothesis,
member(cesare),
file('/export/starexec/sandbox/tmp/tmp.cLpjDVRjYo/E---3.1_25228.p',cesare) ).
cnf(guido,hypothesis,
member(guido),
file('/export/starexec/sandbox/tmp/tmp.cLpjDVRjYo/E---3.1_25228.p',guido) ).
cnf(prove_petruchio_has_shaved_lorenzo,negated_conjecture,
~ shaved(petruchio,lorenzo),
file('/export/starexec/sandbox/tmp/tmp.cLpjDVRjYo/E---3.1_25228.p',prove_petruchio_has_shaved_lorenzo) ).
cnf(petruchio,hypothesis,
member(petruchio),
file('/export/starexec/sandbox/tmp/tmp.cLpjDVRjYo/E---3.1_25228.p',petruchio) ).
cnf(lorenzo,hypothesis,
member(lorenzo),
file('/export/starexec/sandbox/tmp/tmp.cLpjDVRjYo/E---3.1_25228.p',lorenzo) ).
cnf(c_0_8,plain,
( shaved(members,X1)
| ~ member(X1)
| ~ member(X2)
| ~ shaved(X1,X2) ),
inference(fof_simplification,[status(thm)],[one_shaved_then_all_shaved]) ).
cnf(c_0_9,plain,
( shaved(X2,X1)
| ~ shaved(members,X1)
| ~ member(X2) ),
inference(fof_simplification,[status(thm)],[all_shaved_then_one_shaved]) ).
cnf(c_0_10,plain,
( shaved(members,X1)
| ~ member(X1)
| ~ member(X2)
| ~ shaved(X1,X2) ),
c_0_8 ).
cnf(c_0_11,hypothesis,
shaved(guido,cesare),
guido_has_shaved_cesare ).
cnf(c_0_12,hypothesis,
member(cesare),
cesare ).
cnf(c_0_13,hypothesis,
member(guido),
guido ).
cnf(c_0_14,plain,
( shaved(X2,X1)
| ~ shaved(members,X1)
| ~ member(X2) ),
c_0_9 ).
cnf(c_0_15,hypothesis,
shaved(members,guido),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_16,hypothesis,
( shaved(X1,guido)
| ~ member(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
~ shaved(petruchio,lorenzo),
inference(fof_simplification,[status(thm)],[prove_petruchio_has_shaved_lorenzo]) ).
cnf(c_0_18,hypothesis,
( shaved(members,X1)
| ~ member(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_16]),c_0_13])]) ).
cnf(c_0_19,negated_conjecture,
~ shaved(petruchio,lorenzo),
c_0_17 ).
cnf(c_0_20,hypothesis,
( shaved(X1,X2)
| ~ member(X1)
| ~ member(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_21,hypothesis,
member(petruchio),
petruchio ).
cnf(c_0_22,hypothesis,
member(lorenzo),
lorenzo ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ003-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/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 : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 11:08:44 EDT 2024
% 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.cLpjDVRjYo/E---3.1_25228.p
% 0.20/0.49 # Version: 3.1.0
% 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 # sh5l with pid 25364 completed with status 0
% 0.20/0.49 # Result found by sh5l
% 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 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FHUNF-FFSS00-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 25371 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 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FHUNF-FFSS00-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 Unsatisfiable
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 8
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 8
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 8
% 0.20/0.49 # Processed clauses : 21
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 21
% 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 : 2
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 10
% 0.20/0.49 # ...of the previous two non-redundant : 8
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 10
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 6
% 0.20/0.49 # ...of those cached : 2
% 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 : 11
% 0.20/0.49 # Positive orientable unit clauses : 6
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 4
% 0.20/0.49 # Current number of unprocessed clauses: 3
% 0.20/0.49 # ...number of literals in the above : 8
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 10
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 2
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 2
% 0.20/0.49 # Non-unit clause-clause subsumptions : 2
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 269
% 0.20/0.49 # Search garbage collected termcells : 14
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.000 s
% 0.20/0.49 # Total time : 0.004 s
% 0.20/0.49 # Maximum resident set size: 1632 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1692 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------