TSTP Solution File: PUZ056-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PUZ056-1 : TPTP v8.1.0. Released v2.7.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 : n018.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:04 EDT 2022
% Result : Unsatisfiable 7.33s 1.30s
% Output : CNFRefutation 7.33s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ056-1 : TPTP v8.1.0. Released v2.7.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun May 29 03:34:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 11 Number of unprocessed: 11
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 11 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 1 conjectures.
% 0.12/0.36 # There are 1 start rule candidates:
% 0.12/0.36 # Found 10 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 1 extension rule candidate clauses
% 0.12/0.36 # 10 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.36 # Creating equality axioms
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 14 tableaux to operate on
% 7.33/1.30 # There were 1 total branch saturation attempts.
% 7.33/1.30 # There were 0 of these attempts blocked.
% 7.33/1.30 # There were 0 deferred branch saturation attempts.
% 7.33/1.30 # There were 0 free duplicated saturations.
% 7.33/1.30 # There were 1 total successful branch saturations.
% 7.33/1.30 # There were 0 successful branch saturations in interreduction.
% 7.33/1.30 # There were 0 successful branch saturations on the branch.
% 7.33/1.30 # There were 1 successful branch saturations after the branch.
% 7.33/1.30 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.33/1.30 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.33/1.30 # Begin clausification derivation
% 7.33/1.30
% 7.33/1.30 # End clausification derivation
% 7.33/1.30 # Begin listing active clauses obtained from FOF to CNF conversion
% 7.33/1.30 cnf(i_0_17, plain, (fits(small,pin(X1)))).
% 7.33/1.30 cnf(i_0_18, plain, (fits(medium,pin(X1)))).
% 7.33/1.30 cnf(i_0_19, plain, (fits(large,pin(X1)))).
% 7.33/1.30 cnf(i_0_20, plain, (fits(small,on(medium,X1)))).
% 7.33/1.30 cnf(i_0_22, plain, (fits(small,on(large,X1)))).
% 7.33/1.30 cnf(i_0_21, plain, (fits(medium,on(large,X1)))).
% 7.33/1.30 cnf(i_0_15, plain, (nextto(nextto(X1,X2),X3)=nextto(X1,nextto(X2,X3)))).
% 7.33/1.30 cnf(i_0_12, plain, (state(nextto(pin(n2),nextto(pin(n3),on(small,on(medium,on(large,pin(n1))))))))).
% 7.33/1.30 cnf(i_0_14, plain, (nextto(X1,X2)=nextto(X2,X1))).
% 7.33/1.30 cnf(i_0_13, negated_conjecture, (~state(nextto(pin(n1),nextto(pin(n2),on(small,on(medium,on(large,pin(n3))))))))).
% 7.33/1.30 cnf(i_0_16, plain, (nextto(on(X1,X2),X3)=nextto(X2,on(X1,X3))|~fits(X1,X3)|~fits(X1,X2))).
% 7.33/1.30 cnf(i_0_27, plain, (X4=X4)).
% 7.33/1.30 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 7.33/1.30 # Begin printing tableau
% 7.33/1.30 # Found 7 steps
% 7.33/1.30 cnf(i_0_17, plain, (fits(small,pin(X8))), inference(start_rule)).
% 7.33/1.30 cnf(i_0_36, plain, (fits(small,pin(X8))), inference(extension_rule, [i_0_35])).
% 7.33/1.30 cnf(i_0_72, plain, ($false), inference(closure_rule, [i_0_27])).
% 7.33/1.30 cnf(i_0_71, plain, (fits(small,pin(X8))), inference(extension_rule, [i_0_16])).
% 7.33/1.30 cnf(i_0_73, plain, ($false), inference(closure_rule, [i_0_27])).
% 7.33/1.30 cnf(i_0_77, plain, (~fits(small,pin(X1))), inference(closure_rule, [i_0_17])).
% 7.33/1.30 cnf(i_0_75, plain, (nextto(on(small,pin(X1)),pin(X8))=nextto(pin(X1),on(small,pin(X8)))), inference(etableau_closure_rule, [i_0_75, ...])).
% 7.33/1.30 # End printing tableau
% 7.33/1.30 # SZS output end
% 7.33/1.30 # Branches closed with saturation will be marked with an "s"
% 7.33/1.31 # Child (14220) has found a proof.
% 7.33/1.31
% 7.33/1.31 # Proof search is over...
% 7.33/1.31 # Freeing feature tree
%------------------------------------------------------------------------------