%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PUZ035-4 : TPTP v8.1.0. Released v2.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 : n029.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 : Mon Jul 18 18:11:01 EDT 2022 % Result : Unsatisfiable 0.13s 0.37s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : PUZ035-4 : TPTP v8.1.0. Released v2.0.0. % 0.08/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n029.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sat May 28 23:07:13 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 14 Number of unprocessed: 14 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 14 beginning clauses after preprocessing and clausification % 0.13/0.36 # Creating start rules for all 1 conjectures. % 0.13/0.36 # There are 1 start rule candidates: % 0.13/0.36 # Found 2 unit axioms. % 0.13/0.36 # 1 start rule tableaux created. % 0.13/0.36 # 12 extension rule candidate clauses % 0.13/0.36 # 2 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.36 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.13/0.36 # We now have 10 tableaux to operate on % 0.13/0.37 # Ran out of tableaux, making start rules for all clauses % 0.13/0.37 # Ran out of tableaux, making start rules for all clauses % 0.13/0.37 # There were 3 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 3 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 3 successful branch saturations after the branch. % 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_26, plain, (person(asked))). % 0.13/0.37 cnf(i_0_27, plain, (person(other))). % 0.13/0.37 cnf(i_0_22, plain, (~truth(not(X1))|~truth(X1))). % 0.13/0.37 cnf(i_0_16, plain, (~truth(isa(X1,knight))|~truth(isa(X1,knave)))). % 0.13/0.37 cnf(i_0_28, negated_conjecture, (~says(asked,X1)|~truth(isa(asked,X2))|~truth(isa(other,X3)))). % 0.13/0.37 cnf(i_0_20, plain, (truth(not(X1))|truth(X1)|~says(X2,X1))). % 0.13/0.37 cnf(i_0_23, plain, (truth(X1)|truth(X2)|~truth(or(X1,X2)))). % 0.13/0.37 cnf(i_0_25, plain, (~truth(not(or(X1,X2)))|~truth(X2))). % 0.13/0.37 cnf(i_0_24, plain, (~truth(not(or(X1,X2)))|~truth(X1))). % 0.13/0.37 cnf(i_0_17, plain, (truth(X1)|~says(X2,X1)|~truth(isa(X2,knight)))). % 0.13/0.37 cnf(i_0_18, plain, (truth(isa(X1,knight))|~says(X1,X2)|~truth(X2))). % 0.13/0.37 cnf(i_0_15, plain, (truth(isa(X1,knave))|truth(isa(X1,knight))|~person(X1))). % 0.13/0.37 cnf(i_0_21, plain, (truth(not(X1))|truth(X1)|~says(X2,not(X1)))). % 0.13/0.37 cnf(i_0_19, plain, (says(asked,not(or(isa(asked,knight),isa(other,knight))))|says(asked,or(isa(asked,knight),isa(other,knight))))). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 6 steps % 0.13/0.37 cnf(i_0_19, plain, (says(asked,not(or(isa(asked,knight),isa(other,knight))))|says(asked,or(isa(asked,knight),isa(other,knight)))), inference(start_rule)). % 0.13/0.37 cnf(i_0_156, plain, (says(asked,not(or(isa(asked,knight),isa(other,knight))))), inference(extension_rule, [i_0_20])). % 0.13/0.37 cnf(i_0_162, plain, (truth(not(not(or(isa(asked,knight),isa(other,knight)))))), inference(extension_rule, [i_0_22])). % 0.13/0.37 cnf(i_0_157, plain, (says(asked,or(isa(asked,knight),isa(other,knight)))), inference(etableau_closure_rule, [i_0_157, ...])). % 0.13/0.37 cnf(i_0_163, plain, (truth(not(or(isa(asked,knight),isa(other,knight))))), inference(etableau_closure_rule, [i_0_163, ...])). % 0.13/0.37 cnf(i_0_165, plain, (~truth(not(not(not(or(isa(asked,knight),isa(other,knight))))))), inference(etableau_closure_rule, [i_0_165, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Child (5187) has found a proof. % 0.13/0.38 % 0.13/0.38 # Proof search is over... % 0.13/0.38 # Freeing feature tree %------------------------------------------------------------------------------