TSTP Solution File: MSC007-2.005 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MSC007-2.005 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n026.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 : Sun Jul 17 22:43:14 EDT 2022
% Result : Unsatisfiable 0.18s 0.40s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MSC007-2.005 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.32 % Computer : n026.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Fri Jul 1 15:22:34 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.18/0.35 # No SInE strategy applied
% 0.18/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.35 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.35 #
% 0.18/0.35 # Presaturation interreduction done
% 0.18/0.35 # Number of axioms: 29 Number of unprocessed: 29
% 0.18/0.35 # Tableaux proof search.
% 0.18/0.35 # APR header successfully linked.
% 0.18/0.35 # Hello from C++
% 0.18/0.35 # The folding up rule is enabled...
% 0.18/0.35 # Local unification is enabled...
% 0.18/0.35 # Any saturation attempts will use folding labels...
% 0.18/0.35 # 29 beginning clauses after preprocessing and clausification
% 0.18/0.35 # Creating start rules for all 1 conjectures.
% 0.18/0.35 # There are 1 start rule candidates:
% 0.18/0.35 # Found 25 unit axioms.
% 0.18/0.35 # 1 start rule tableaux created.
% 0.18/0.35 # 4 extension rule candidate clauses
% 0.18/0.35 # 25 unit axiom clauses
% 0.18/0.35
% 0.18/0.35 # Requested 8, 32 cores available to the main process.
% 0.18/0.35 # There are not enough tableaux to fork, creating more from the initial 1
% 0.18/0.35 # Creating equality axioms
% 0.18/0.35 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.35 # Returning from population with 34 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.35 # We now have 34 tableaux to operate on
% 0.18/0.40 # There were 4 total branch saturation attempts.
% 0.18/0.40 # There were 0 of these attempts blocked.
% 0.18/0.40 # There were 0 deferred branch saturation attempts.
% 0.18/0.40 # There were 0 free duplicated saturations.
% 0.18/0.40 # There were 4 total successful branch saturations.
% 0.18/0.40 # There were 0 successful branch saturations in interreduction.
% 0.18/0.40 # There were 0 successful branch saturations on the branch.
% 0.18/0.40 # There were 4 successful branch saturations after the branch.
% 0.18/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.40 # Begin clausification derivation
% 0.18/0.40
% 0.18/0.40 # End clausification derivation
% 0.18/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.40 cnf(i_0_36, plain, (pigeon(pigeon_1))).
% 0.18/0.40 cnf(i_0_37, plain, (pigeon(pigeon_2))).
% 0.18/0.40 cnf(i_0_38, plain, (pigeon(pigeon_3))).
% 0.18/0.40 cnf(i_0_39, plain, (pigeon(pigeon_4))).
% 0.18/0.40 cnf(i_0_40, plain, (pigeon(pigeon_5))).
% 0.18/0.40 cnf(i_0_51, plain, (hole(hole_1))).
% 0.18/0.40 cnf(i_0_52, plain, (hole(hole_2))).
% 0.18/0.40 cnf(i_0_53, plain, (hole(hole_3))).
% 0.18/0.40 cnf(i_0_54, plain, (hole(hole_4))).
% 0.18/0.40 cnf(i_0_41, plain, (pigeon_1!=pigeon_2)).
% 0.18/0.40 cnf(i_0_42, plain, (pigeon_1!=pigeon_3)).
% 0.18/0.40 cnf(i_0_45, plain, (pigeon_3!=pigeon_2)).
% 0.18/0.40 cnf(i_0_43, plain, (pigeon_1!=pigeon_4)).
% 0.18/0.40 cnf(i_0_46, plain, (pigeon_4!=pigeon_2)).
% 0.18/0.40 cnf(i_0_48, plain, (pigeon_4!=pigeon_3)).
% 0.18/0.40 cnf(i_0_44, plain, (pigeon_1!=pigeon_5)).
% 0.18/0.40 cnf(i_0_47, plain, (pigeon_5!=pigeon_2)).
% 0.18/0.40 cnf(i_0_49, plain, (pigeon_5!=pigeon_3)).
% 0.18/0.40 cnf(i_0_50, plain, (pigeon_5!=pigeon_4)).
% 0.18/0.40 cnf(i_0_55, plain, (hole_2!=hole_1)).
% 0.18/0.40 cnf(i_0_56, plain, (hole_3!=hole_1)).
% 0.18/0.40 cnf(i_0_58, plain, (hole_3!=hole_2)).
% 0.18/0.40 cnf(i_0_57, plain, (hole_4!=hole_1)).
% 0.18/0.40 cnf(i_0_59, plain, (hole_4!=hole_2)).
% 0.18/0.40 cnf(i_0_60, plain, (hole_4!=hole_3)).
% 0.18/0.40 cnf(i_0_62, plain, (hole(hole_of(X1))|~pigeon(X1))).
% 0.18/0.40 cnf(i_0_63, plain, (in(X1,hole_of(X1))|~pigeon(X1))).
% 0.18/0.40 cnf(i_0_61, plain, (X1=hole_4|X1=hole_3|X1=hole_2|X1=hole_1|~hole(X1))).
% 0.18/0.40 cnf(i_0_64, negated_conjecture, (X1=X2|~in(X2,X3)|~in(X1,X3)|~hole(X3)|~pigeon(X2)|~pigeon(X1))).
% 0.18/0.40 cnf(i_0_101, plain, (X4=X4)).
% 0.18/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.40 # Begin printing tableau
% 0.18/0.40 # Found 7 steps
% 0.18/0.40 cnf(i_0_36, plain, (pigeon(pigeon_1)), inference(start_rule)).
% 0.18/0.40 cnf(i_0_109, plain, (pigeon(pigeon_1)), inference(extension_rule, [i_0_62])).
% 0.18/0.40 cnf(i_0_150, plain, (hole(hole_of(pigeon_1))), inference(extension_rule, [i_0_61])).
% 0.18/0.40 cnf(i_0_188, plain, (hole_of(pigeon_1)=hole_4), inference(etableau_closure_rule, [i_0_188, ...])).
% 0.18/0.40 cnf(i_0_189, plain, (hole_of(pigeon_1)=hole_3), inference(etableau_closure_rule, [i_0_189, ...])).
% 0.18/0.40 cnf(i_0_190, plain, (hole_of(pigeon_1)=hole_2), inference(etableau_closure_rule, [i_0_190, ...])).
% 0.18/0.40 cnf(i_0_191, plain, (hole_of(pigeon_1)=hole_1), inference(etableau_closure_rule, [i_0_191, ...])).
% 0.18/0.40 # End printing tableau
% 0.18/0.40 # SZS output end
% 0.18/0.40 # Branches closed with saturation will be marked with an "s"
% 0.18/0.40 # Child (17992) has found a proof.
% 0.18/0.40
% 0.18/0.40 # Proof search is over...
% 0.18/0.40 # Freeing feature tree
%------------------------------------------------------------------------------